A Matrix model for plane partitions

Abstract

We construct a matrix model equivalent (exactly, not asymptotically), to the random plane partition model, with almost arbitrary boundary conditions. Equivalently, it is also a random matrix model for a TASEP-like process with arbitrary boundary conditions. Using the known solution of matrix models, this method allows to find the large size asymptotic expansion of plane partitions, to ALL orders. It also allows to describe several universal regimes.

Latex, 41 figures. Misprints and corrections. Changing the term TASEP to self avoiding particle porcess

References in corpus (13)

• Level-Spacing Distributions and the Airy Kernel
• 2D Gravity and Random Matrices
• Universal Distributions for Growth Processes in 1+1 Dimensions and Random Matrices
• Local statistics of lattice dimers
• Hermitean matrix model free energy: Feynman graph technique for all genera
• Universal singularity at the closure of a gap in a random matrix theory
• The asymmetric simple exclusion process: an integrable model for non-equilibrium statistical mechanics
• Gromov-Witten invariants in algebraic geometry
• Matrices coupled in a chain. I. Eigenvalue correlations
• Six-Vertex Model with Domain Wall Boundary Conditions and One-Matrix Model
• Polynuclear growth on a flat substrate and edge scaling of GOE eigenvalues
• Master loop equations, free energy and correlations for the chain of matrices
• Universal distribution of random matrix eigenvalues near the "birth of a cut" transition

Cited by in corpus (7)

• Matrix models for $\beta$-ensembles from Nekrasov partition functions
• Wall Crossing As Seen By Matrix Models
• A tangent method derivation of the arctic curve for q-weighted paths with arbitrary starting points
• The remodeling conjecture and the Faber-Pandharipande formula
• Wall-crossing, open BPS counting and matrix models
• Matrix models and stochastic growth in Donaldson-Thomas theory
• Limit shape for infinite rank limit of tensor power decomposition for Lie algebras of series so(2n+1)