Estimating the asymptotics of solid partitions

Abstract

We study the asymptotic behavior of solid partitions using transition matrix Monte Carlo simulations. If $p_3(n)$ denotes the number of solid partitions of an integer $n$, we show that ${\lim }_{n\to \infty }{n}^{-3/4}\log p_3(n)\sim 1.822\pm 0.001$. This shows clear deviation from the value $1.7898$, attained by MacMahon numbers $m_3(n)$, that was conjectured to hold for solid partitions as well. In addition, we find estimates for other sub-leading terms in $\log p_3(n)$. In a pattern deviating from the asymptotics of line and plane partitions, we need to add an oscillatory term in addition to the obvious sub-leading terms. The period of the oscillatory term is proportional to $n^{1/4}$, the natural scale in the problem. This new oscillatory term might shed some insight into why partitions in dimensions greater than two do not admit a simple generating function.

21 pages, 8 figures

References in corpus (5)

• Quantum dynamics in high codimension tilings: from quasiperiodicity to disorder
• On the asymptotics of higher-dimensional partitions
• On the Asymptotic Formula for the Number of Plane Partitions of Positive Integers
• Enumeration of octagonal tilings
• A superasymptotic formula for the number of plane partitions

Cited by in corpus (4)

• Magnificent Four with Colors
• Stochastic Dynamics of Growing Young Diagrams and Their Limit Shapes
• On the cardinality of lower sets and universal discretization
• Bounds for the number of multidimensional partitions