Dimers on rail yard graphs
From MaRDI portal
plane partitionsdeterminantal processesAztec diamondvertex operatorsSchur processfree fermionsdimer models
Interacting random processes; statistical mechanics type models; percolation theory (60K35) Exact enumeration problems, generating functions (05A15) Combinatorial probability (60C05) Symmetric functions and generalizations (05E05) Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics (82B20)
Abstract: We introduce a general model of dimer coverings of certain plane bipartite graphs, which we call rail yard graphs (RYG). The transfer matrices used to compute the partition function are shown to be isomorphic to certain operators arising in the so-called boson-fermion correspondence. This allows to reformulate the RYG dimer model as a Schur process, i.e. as a random sequence of integer partitions subject to some interlacing conditions. Beyond the computation of the partition function, we provide an explicit expression for all correlation functions or, equivalently, for the inverse Kasteleyn matrix of the RYG dimer model. This expression, which is amenable to asymptotic analysis, follows from an exact combinatorial description of the operators localizing dimers in the transfer-matrix formalism, and then a suitable application of Wick's theorem. Plane partitions, domino tilings of the Aztec diamond, pyramid partitions, and steep tilings arise as particular cases of the RYG dimer model. For the Aztec diamond, we provide new derivations of the edge-probability generating function, of the biased creation rate, of the inverse Kasteleyn matrix and of the arctic circle theorem.
Recommendations
Cited in
(20)- Arctic curve of the free-fermion six-vertex model in an L-shaped domain
- Arctic curves of the six-vertex model on generic domains: the tangent method
- The free boundary Schur process and applications
- Fourier transform on high-dimensional unitary groups with applications to random tilings
- The free boundary Schur process and applications. I
- Limit shape and height fluctuations of random perfect matchings on square-hexagon lattices
- Arctic boundaries of the ice model on three-bundle domains
- Asymptotics of random domino tilings of rectangular Aztec diamonds
- Periodic Pólya urns, the density method and asymptotics of Young tableaux
- Limit Shape of Perfect Matchings on Rail-Yard Graphs
- Free fermion six vertex model: symmetric functions and random domino tilings
- Discrete dynamics in cluster integrable systems from geometric \(R\)-matrix transformations
- The Schwarzian octahedron recurrence (dSKP equation) I: explicit solutions
- From Aztec diamonds to pyramids: Steep tilings
- Double-dimer pairings and skew Young diagrams
- Airy point process at the liquid-gas boundary
- Shuffling algorithm for coupled tilings of the Aztec diamond
- Domino statistics of the two-periodic Aztec diamond
- Interface fluctuations associated with split Fermi seas
- Asymptotics of pure dimer coverings on rail yard graphs
This page was built for publication: Dimers on rail yard graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q679659)