Asymptotic formulas and limit distributions for combinatorial configurations generated by polynomials
From MaRDI portal
Publication:5439055
DOI10.1515/dma.2007.027zbMath1255.05015MaRDI QIDQ5439055
Publication date: 8 February 2008
Published in: Discrete Mathematics and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1515/dma.2007.027
05A15: Exact enumeration problems, generating functions
05A18: Partitions of sets
05A16: Asymptotic enumeration
05D40: Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.)
Related Items
Local probabilities for random permutations without long cycles, Permutations without long or short cycles, Generalized allocation scheme with cell occupancies from a fixed finite set, Random permutations with cycle lengths in a given finite set, A limit theorem for the logarithm of the order of a random A-permutation
Cites Work