Asymptotic formulas and limit distributions for combinatorial configurations generated by polynomials
From MaRDI portal
Publication:5439055
DOI10.1515/dma.2007.027zbMath1255.05015OpenAlexW2059792039MaRDI 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
Exact enumeration problems, generating functions (05A15) Partitions of sets (05A18) Asymptotic enumeration (05A16) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)
Related Items (5)
Local probabilities for random permutations without long cycles ⋮ Generalized allocation scheme with cell occupancies from a fixed finite set ⋮ Permutations without long or short cycles ⋮ 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
This page was built for publication: Asymptotic formulas and limit distributions for combinatorial configurations generated by polynomials
