Skip to main content Accessibility help

Random Sampling of Plane Partitions



This article presents uniform random generators of plane partitions according to size (the number of cubes in the 3D interpretation). Combining a bijection of Pak with the method of Boltzmann sampling, we obtain random samplers that are slightly superlinear: the complexity is O(n(ln n)3) in approximate-size sampling and O(n4/3) in exact-size sampling (under a real-arithmetic computation model). To our knowledge, these are the first polynomial-time samplers for plane partitions according to size (there exist polynomial-time samplers of another type, which draw plane partitions that fit inside a fixed bounding box). The same principles yield efficient samplers for (a × b)-boxed plane partitions (plane partitions with two dimensions bounded), and for skew plane partitions. The random samplers allow us to perform simulations and observe limit shapes and frozen boundaries, which have been analysed recently by Cerf and Kenyon for plane partitions, and by Okounkov and Reshetikhin for skew plane partitions.



Hide All
[1]Bender, E. A. and Knuth, D. E. (1972) Enumeration of plane partitions. J. Combin. Theory Ser. A 13 4054.
[2]Bressoud, D. M. (1999) Proofs and Confirmations: The Story of the Alternating Sign Matrix Conjecture, Cambridge University Press, New York.
[3]Cerf, R. and Kenyon, R. (2001) The low-temperature expansion of the Wulff crystal in the 3D Ising model. Comm. Math. Phys. 222 147179.
[4]Cohn, H., Larsen, M. and Propp, J. (1998) The shape of a typical boxed plane partition. New York J. Math. 4 137166.
[5]Duchon, P., Flajolet, P., Louchard, G. and Schaeffer, G. (2004) Boltzmann samplers for the random generation of combinatorial structures. Combin. Probab. Comput. 13 577625.
[6]Flajolet, P., Fusy, É. and Pivoteau, C. (2007) Boltzmann sampling of unlabelled structures. In Proc. 4th Workshop on Analytic Algorithms and Combinatorics: ANALCO'07 (New Orleans), SIAM, pp. 201211.
[7]Flajolet, P., Gourdon, X. and Dumas, P. (1995) Mellin transforms and asymptotics: Harmonic sums. Theoret. Comput. Sci. 144 358.
[8]Flajolet, P. and Sedgewick, R. (2009) Analytic Combinatorics, Cambridge University Press.
[9]Flajolet, P., Zimmerman, P. and Van Cutsem, B. (1994) A calculus for the random generation of labelled combinatorial structures. Theoret. Comput. Sci. 132 135.
[10]Fusy, É. (2007) Uniform random sampling of planar graphs in linear time. Random Struct. Alg., to appear. arXiv:0705.1287
[11]Gansner, E. R. (1981) Matrix correspondences of plane partitions. Pac. J. Math. 92 295315.
[12]Knuth, D. E. (1970) Permutations, matrices, and generalized Young tableaux. Pacific J. Math. 34 709727.
[13]Krattenthaler, C. (1999) Another involution principle-free bijective proof of Stanley's hook-content formula. J. Combin. Theory Ser. A 88 6692.
[14]Ma, J. and Janse van Rensburg, E. J. (2005) Rectangular vesicles in three dimensions. J. Phys. A 38 41154147.
[15]MacMahon, P. A. (1912) Memoir on the theory of the partitions of numbers VI: Partitions in two-dimensional space, to which is added an adumbration of the theory of partitions in three-dimensional space. Phil. Trans. Roy. Soc. London Ser. A 211 345373.
[16]Maeda, T. and Nakatsu, T. (2007) Amoebas and instantons. Int. J. Mod. Phys. A 22 937984.
[17]Meinardus, G. (1954) Asymptotische Aussagen über Partitionen. Math. Z. 59 388398.
[18]Mutafchiev, L. (2006) The size of the largest part of random plane partitions of large integers. Integers 6 A13.
[19]Mutafchiev, L. and Kamenov, E. (2006) Asymptotic formula for the number of plane partitions of positive integers. CR Acad. Bulgare Sci. 59 361366.
[20]Nijenhuis, A. and Wilf, H. S. (1978) Combinatorial Algorithms, 2nd edn, Academic Press.
[21]Novelli, J.-C., Pak, I. and Stoyanovskii, A. V. (1997) A direct bijective proof of the hook-length formula. Discrete Math. Theor. Comput. Sci. 1 5367.
[22]Okounkov, A. and Reshetikhin, N. (2003) Correlation function of Schur process with application to local geometry of a random 3-dimensional young diagram. J. Amer. Math. Soc. 16 581603.
[23]Okounkov, A. and Reshetikhin, N. (2007) Random skew plane partitions and the Pearcey process. Comm. Math. Phys. 269.
[24]Pak, I. (2001/02) Hook length formula and geometric combinatorics. Séminaire Lotharingien de Combinatoire 46 #B46f.
[25]Pivoteau, C., Salvy, B. and Soria, M. (2008) Boltzmann oracle for combinatorial systems. In Algorithms, Trees, Combinatorics and Probabilities: Proc. 5th Colloquium on Mathematics and Computer Science, DMTCS Proceedings, pp. 475488.
[26]Propp, J. (1997) Generating random elements of finite distributive lattices. Electron. J. Combin. 4 #15.
[27]Vershik, A. M. (1996) Statistical mechanics of combinatorial partitions, and their limit configurations. Funct. Anal. Appl. 30 90105.
[28]Wilson, D. B. (1997) Determinant algorithms for random planar structures. In SODA ’97: Proc. 8th Annual ACM–SIAM Symposium on Discrete Algorithms, SIAM, Philadelphia, PA, USA, pp. 258267.
[29]Wright, E. M. (1931) Asymptotic partition formulae I: Plane partitions. Quart. J. Math. Oxford Ser. 2 177–189.
[30]Young, A. (1901) On quantitative substitutional analysis. Proc. Lond. Math. Soc. 33 97146.
[31]Zeilberger, D. (1996) Proof of the alternating sign matrix conjecture. Electron. J. Combin. 3 #13.

Related content

Powered by UNSILO

Random Sampling of Plane Partitions



Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed.