On the asymptotics of higher-dimensional partitions
Abstract
We conjecture that the asymptotic behavior of the numbers of solid (three-dimensional) partitions is identical to the asymptotics of the three-dimensional MacMahon numbers. Evidence is provided by an exact enumeration of solid partitions of all integers <=68 whose numbers are reproduced with surprising accuracy using the asymptotic formula (with one free parameter) and better accuracy on increasing the number of free parameters. We also conjecture that similar behavior holds for higher-dimensional partitions and provide some preliminary evidence for four and five-dimensional partitions.
Keywords
Cite
@article{arxiv.1105.6231,
title = {On the asymptotics of higher-dimensional partitions},
author = {Srivatsan Balakrishnan and Suresh Govindarajan and Naveen S. Prabhakar},
journal= {arXiv preprint arXiv:1105.6231},
year = {2012}
}
Comments
30 pages, 8 tables, 4 figures (v2) New data (63-68) for solid partitions added; (v3) published version, new subsection providing an unbiased estimate of the leading for the leading coefficient added, some tables deleted