A superasymptotic formula for the number of plane partitions

We revisit a formula for the number of plane partitions due to Almkvist. Using the circle method, we provide modifications to his formula along with estimates of the errors. We show that the improved formula continues to be an asymptotic series. Nevertheless, an optimal truncation (i.e., superasympt...

Full description

Saved in:
Bibliographic Details
Published inarXiv.org
Main Authors Govindarajan, Suresh, Prabhakar, Naveen S
Format Paper
LanguageEnglish
Published Ithaca Cornell University Library, arXiv.org 29.07.2014
Subjects
Asymptotic series
Digits
Integers
Partitions
Online AccessGet full text

Cover

More Information
Summary:We revisit a formula for the number of plane partitions due to Almkvist. Using the circle method, we provide modifications to his formula along with estimates of the errors. We show that the improved formula continues to be an asymptotic series. Nevertheless, an optimal truncation (i.e., superasymptotic) of the formula provides exact numbers of plane partitions for all positive integers n <6400 and numbers with estimated errors for larger values. For instance, the formula correctly reproduces 305 of the 316 digits of the numbers of plane partitions of 6999 as predicted by the estimated error. We believe that an hyperasymptotic truncation might lead to exact numbers for positive integers up to 50000.
ISSN:2331-8422