We give a new asymptotic formula for a refined enumeration of plane partitions. Specifically: color the parts πi,j of a plane partition n according to the equivalence class of i - j (mod 2), and keep track of the sums of the 0-colored and 1-colored parts seperately. We find, for large plane partitions, that the difference between these two sums is asymptotically Gaussian (and we compute the mean and standard deviation of the distribution). Our approach is to modify a multivariate technique of Haselgrove and Temperley.

Additional Metadata
Conference 7th Workshop on Analytic Algorithmics and Combinatorics, ANALCO 2010
Panario, D, Richmond, B. (Bruce), & Young, B. (Benjamin). (2010). Bivariate asymptotics for striped plane partitions. In Workshop on Analytic Algorithmics and Combinatorics 2010, ANALCO 2010 (pp. 18–26).