Metraipolis › archive › dc_ade522c657b5

Estimating the asymptotics of integer partitions in intermediate dimensions ($d = 3,4,5,6$) — arXiv:2609.03034

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.03034
License (as archived)
CC0-1.0
Archived
2026-10-17T02:33:49.757Z
SHA-256 of the archived text
c4f10b2f76495c9cd7bd1c5c68c7557c5081c9c422acefb5ca5aafee3f23a6ea
Stable URL of this page
https://metraipolis.com/documento/dc_ade522c657b5

How to cite

Estimating the asymptotics of integer partitions in intermediate dimensions ($d = 3,4,5,6$) — arXiv:2609.03034 — arXiv (en), https://arxiv.org/abs/2609.03034 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_ade522c657b5 (Metraipolis archive dc_ade522c657b5, sha256 c4f10b2f76495c9cd7bd1c5c68c7557c5081c9c422acefb5ca5aafee3f23a6ea)
BibTeX
@misc{dcade522c657b5,
  title = {Estimating the asymptotics of integer partitions in intermediate dimensions ($d = 3,4,5,6$) — arXiv:2609.03034},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.03034},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_ade522c657b5; sha256 c4f10b2f76495c9cd7bd1c5c68c7557c5081c9c422acefb5ca5aafee3f23a6ea},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.03034. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

It was recently shown by Yeliussizov \cite{Yeliussizov} that integer partitions in dimensions $d \geq 7$ asymptotically grow strictly faster than MacMahon numbers. As MacMahon numbers match with integer partitions in dimensions $d = 1,2$, the comparison of asymptotics of integer partitions with MacMahon numbers in intermediate dimensions ($d = 3,4,5,6$) is an open question. In this work, we perform Markov chain Monte Carlo (MCMC) simulations till $N=15000$ by using adaptive weight learning followed by conventional MCMC steps to numerically estimate the asymptotics of integer partitions in these intermediate dimensions. We numerically establish that in these intermediate dimensions, partitions asymptotically grow faster than MacMahon numbers. More specifically, assuming that the limits exist, we show: $\lim_{n\to\infty}n^{-3/4}\log p_3(n) = 1.8196 \pm 0.0019$, $\lim_{n\to\infty}n^{-4/5}\log p_4(n) = 1.7215 \pm 0.0045$, $\lim_{n\to\infty}n^{-5/6}\log p_5(n) = 1.6521 \pm 0.0059$, and $\lim_{n\to\infty}\log n^{-6/7}p_6(n) = 1.652 \pm 0.021$ for partitions in dimensions $d=3,4,5,$ and $6$ respectively. These numbers are all larger than MacMahon leading order asymptotic coefficients of $1.7898, 1.6614, 1.5737,$ and $1.509$ respectively. Additionally, we also find estimates for some of the sub-leading asymptotic terms in $\log p_d(n)$ in each of the dimensions.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-04 in math.CO).
Categorie arXiv: Mathematical Physics (math-ph) ; Statistical Mechanics (cond-mat.stat-mech); High Energy Physics - Theory (hep-th); Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2609.03034 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-17T02:09:21.199Z dalla pagina https://arxiv.org/catchup/math.CO/2026-09-04?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).