Generatingfunctionology (Hardback)
$51.05 - Free shipping worldwide (to United States and
all these other countries) Usually dispatched within 72 hours | |Short Description for Generatingfunctionology 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.
Full description- Publisher: A K Peters
- Published: 01 February 2006
- Format: Hardback 192 pages
- See: Full bibliographic data
- Categories: Calculus & Mathematical Analysis | Calculus | Functional Analysis & Transforms | Combinatorics & Graph Theory | Algorithms & Data Structures
- ISBN 13: 9781568812793 ISBN 10: 1568812795
- Sales rank: 448,141
Full description for Generatingfunctionology
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. 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.
