2000 character limit reached
Large Parts of Random Plane Partitions: a Poisson Limit Theorem (2003.11577v4)
Published 25 Mar 2020 in math.CO
Abstract: We propose an aproach for asymptotic analysis of plane partition statistics related to counts of parts whose sizes exceed a certain suitably chosen level. In our study, we use the concept of conjugate trace of a plane partition of the positive integer $n$, introduced by Stanley in 1973. We derive generating functions and determine the asymptotic behavior of counts of large parts using a general scheme based on the saddle point method. In this way, we are able to prove a Poisson limit theorem for the number of parts of a random and uniformly chosen plane partition of $n$, whose sizes are greater than a function $m=m(n)$ as $n\to\infty$. An explicit expression for $m(n)$ is also given.