A Meinardus theorem with multiple singularities

DOI10.1007/S00220-012-1526-8MaRDI QIDQ453341zbMATH OpenOpenAlexFDO

Authors Boris Granovsky, Dudley Stark

Publication date 19 September 2012

Published in Communications in Mathematical Physics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1102.5608

zbMATH Keywords

Dirichlet generating functionMeinardus' theoremweighted partition

Mathematics Subject Classification ID

Combinatorial probability (60C05) Statistical mechanics of gases (82D05)

Abstract: Meinardus proved a general theorem about the asymptotics of the number of weighted partitions, when the Dirichlet generating function for weights has a single pole on the positive real axis. Continuing cite{GSE}, we derive asymptotics for the numbers of three basic types of decomposable combinatorial structures (or, equivalently, ideal gas models in statistical mechanics) of size $n$, when their Dirichlet generating functions have multiple simple poles on the positive real axis. Examples to which our theorem applies include ones related to vector partitions and quantum field theory. Our asymptotic formula for the number of weighted partitions disproves the belief accepted in the physics literature that the main term in the asymptotics is determined by the rightmost pole.

Review text

The goal of this work is an extension of Meinardus' theorem about the asymptotics of the number of weighted partitions from the case the Dirichlet generating function for weights has a single pole on the positive real axis to the case when the Dirichlet generating function for weights has more than one simple pole on the real axis. The authors derive asymptotics for the numbers of three basic types of decomposable combinatorical structures of size \(n\), when their Dirichlet generating functions have multiple simple poles on the positive real axis.

Recommendations

• Meinardus' theorem on weighted partitions: Extensions and a probabilistic proof
• Developments in the Khintchine-Meinardus probabilistic method for asymptotic enumeration
• A polynomial variation of Meinardus' theorem
• A central limit theorem for integer partitions
• Limit theorems for the number of parts in a random weighted partition

Cites work

• A central limit theorem for integer partitions
• A spectral analogue of the Meinardus theorem on asymptotics of the number of partitions
• Asymptotic counting of BPS operators in superconformal field theories
• Asymptotic formula for a partition function of reversible coagulation-fragmentation processes
• Asymptotische Aussagen über Partitionen
• Combinatorial stochastic processes. Ecole d'Eté de Probabilités de Saint-Flour XXXII -- 2002.
• Counting BPS operators in gauge theories: quivers, syzygies and plethystics
• scientific article; zbMATH DE number 3146726 (Why is no real title available?)
• Meinardus' theorem on weighted partitions: Extensions and a probabilistic proof
• Statistical mechanics of combinatorial partitions, and their limit shapes
• Tauberian Theory

Cited in

(10)

• Asymptotic enumeration by Khintchine-Meinardus probabilistic method: necessary and sufficient conditions for sub-exponential growth
• M2-branes and plane partitions
• The asymptotic number of weighted partitions with a given number of parts
• A polynomial variation of Meinardus' theorem
• A spectral analogue of the Meinardus theorem on asymptotics of the number of partitions
• A central limit theorem for integer partitions into small powers
• Asymptotic degeneracies of M2-brane SCFTs
• An explicit bound for the number of partitions into roots
• Note on square-root partitions into distinct parts
• Developments in the Khintchine-Meinardus probabilistic method for asymptotic enumeration

This page was built for publication: A Meinardus theorem with multiple singularities

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q453341)