Developments in the Khintchine-Meinardus probabilistic method for asymptotic enumeration
From MaRDI portal
Publication:907220
zbMath1329.05020arXiv1311.2254MaRDI QIDQ907220
Dudley Stark, Boris L. Granovsky
Publication date: 25 January 2016
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1311.2254
asymptotic enumerationMeinardus' theoremDirichlet generating functionsmodels of ideal gas and of quantum field theory
Quantum field theory on lattices (81T25) Asymptotic enumeration (05A16) Limit theorems in probability theory (60F99)
Related Items (5)
Khinchin families and Hayman class ⋮ Asymptotic enumeration by Khintchine-Meinardus probabilistic method: necessary and sufficient conditions for sub-exponential growth ⋮ Limit shapes for Gibbs ensembles of partitions ⋮ On the asymptotics of the element counting function in an additive arithmetic semigroup with exponential counting function of prime generators ⋮ The asymptotic number of weighted partitions with a given number of parts
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Ergodicity of multiplicative statistics
- A Meinardus theorem with multiple singularities
- Statistical mechanics of combinatorial partitions, and their limit shapes
- Mathematics for the Analysis of Algorithms.
- Asymptotic formula for a partition function of reversible coagulation-fragmentation processes
- A hybrid of Darboux's method and singularity analysis in combinatorial asymptotics
- Meinardus' theorem on weighted partitions: Extensions and a probabilistic proof
- On the quantum density of states and partitioning an integer
- Asymptotische Aussagen über Partitionen
- ASYMPTOTIC ENUMERATION AND LOGICAL LIMIT LAWS FOR EXPANSIVE MULTISETS AND SELECTIONS
This page was built for publication: Developments in the Khintchine-Meinardus probabilistic method for asymptotic enumeration