generatingfunctionology -

generatingfunctionology

Third Edition

Hardback

$133.60

Or 4 payments of $33.40 with

delivery message Free delivery for orders over $49.99

Add to Favourites
Sourced from our Overseas Supplier
Delivered in 15 - 23 days
Available for Click and Collect
Generating functions, one of the most important tools in enumerative combinatorics, are a bridge between discrete mathematics and continuous analysis. Generating functions have numerous applications in mathematics, especially in - Combinatorics - Probability Theory - Statistics - Theory of Markov Chains - Number Theory One of the most important and relevant recent applications of combinatorics lies in the development of Internet search engines whose incredible capabilities dazzle even the mathematically trained user.

Product code: 9781568812793

ISBN 9781568812793
Dimensions (HxWxD in mm) H229xW152
No. Of Pages 256
Publisher Taylor & Francis Inc
Edition 3rd New edition
Generating functions, one of the most important tools in enumerative combinatorics, are a bridge between discrete mathematics and continuous analysis. Generating functions have numerous applications in mathematics, especially in: Combinatorics; Probability Theory; Statistics; Theory of Markov Chains; and Number Theory.