A01=Herbert S. Wilf
advanced combinatorial enumeration
analytic combinatorics
asymptotic analysis
Author_Herbert S. Wilf
bell
Bell Numbers
Bipartite Graph
Category=PBK
Connected Graphs
Cyclotomic Polynomials
discrete mathematics
enumerative combinatorics
eq_isMigrated=1
eq_isMigrated=2
eq_nobargain
exponential
Exponential Family
Exponential Formula
Exponential Generating Function
Formal Power Series
formula
functions
Fundamental Lemma
Generating Function
Hypergeometric Term
Kth Root
Label Sets
Lagrange Inversion Formula
Legal String
Log Concave
Markov chain theory
Meromorphic Function
number
Partial Fraction
Partial Fraction Expansion
Partial Fractions
power
Power Series
probability applications
recurrence
relation
Riemann Zeta Function
Sieve Method
stirling
Stirling Numbers
unknown
Unknown Generating Function
Product details
- ISBN 9781568812793
- Weight: 360g
- Dimensions: 152 x 229mm
- Publication Date: 20 Dec 2005
- Publisher: Taylor & Francis Inc
- Publication City/Country: US
- Product Form: Hardback
Secure
checkout
Fast Shipping
Easy returns
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.
