Double-dimer pairings and skew Young diagrams

MaRDI QIDQ547790zbMATH OpenFDO

Authors Richard Kenyon, David B. Wilson

Publication date 24 June 2011

Published in The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1007.2006, http://www.emis.de/journals/EJC/Volume_18/Abstracts/v18i1p130.html

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

double-dimer modelgroveskew Young diagramspanning tree

Mathematics Subject Classification ID

Combinatorial identities, bijective combinatorics (05A19) Combinatorial aspects of tessellation and tiling problems (05B45) Trees (05C05) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Combinatorial probability (60C05) Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics (82B20)

Abstract: We study the number of tilings of skew Young diagrams by ribbon tiles shaped like Dyck paths, in which the tiles are "vertically decreasing". We use these quantities to compute pairing probabilities in the double-dimer model: Given a planar bipartite graph $G$ with special vertices, called nodes, on the outer face, the double-dimer model is formed by the superposition of a uniformly random dimer configuration (perfect matching) of $G$ together with a random dimer configuration of the graph formed from $G$ by deleting the nodes. The double-dimer configuration consists of loops, doubled edges, and chains that start and end at the boundary nodes. We are interested in how the chains connect the nodes. An interesting special case is when the graph is $$ and the nodes are at evenly spaced locations on the boundary $R$ as the grid spacing $epsilono0$.

Review text

Summary: We study the number of tilings of skew Young diagrams by ribbon tiles shaped like Dyck paths, in which the tiles are ``vertically decreasing. We use these quantities to compute pairing probabilities in the double-dimer model: Given a planar bipartite graph \(G\) with special vertices, called nodes, on the outer face, the doubledimer model is formed by the superposition of a uniformly random dimer configuration (perfect matching) of \(G\) together with a random dimer configuration of the graph formed from \(G\) by deleting the nodes. The double-dimer configuration consists of loops, doubled edges, and chains that start and end at the boundary nodes. We are interested in how the chains connect the nodes. An interesting special case is when the graph is \(\varepsilon (\mathbb Z \times \mathbb N)\) and the nodes are at evenly spaced locations on the boundary \(\mathbb R\) as the grid spacing \(\varepsilon \rightarrow 0\).

Recommendations

• Conformal invariance of loops in the double-dimer model
• Dimers on rail yard graphs
• The planar dimer model boundary: A survey
• Combinatorics of the double-dimer model
• Dimers, tilings and trees

Cited in

(25)

• Global and local multiple SLEs for 4 and connection probabilities for level lines of GFF
• Topics in loop measures and the loop-erased walk
• Boundary correlations in planar LERW and UST
• UST branches, martingales, and multiple SLE(2)
• Conformal blocks, \(q\)-combinatorics, and quantum group symmetry
• Dyck tilings, increasing trees, descents, and inversions
• Dyck tilings and the homogeneous Garnir relations for graded Specht modules
• A statistical model of current loops and magnetic monopoles
• The space of circular planar electrical networks
• Schramm's formula for multiple loop-erased random walks
• Proofs of two conjectures of Kenyon and Wilson on Dyck tilings
• Fully packed loops in a triangle: matchings, paths and puzzles
• Generalized Dyck tilings
• Spanning trees of graphs on surfaces and the intensity of loop-erased random walk on planar graphs
• Pfaffian correlation functions of planar dimer covers
• Pfaffian formulas for spanning tree probabilities
• Combinatorics of the double-dimer model
• Mixed dimer configuration model in type D cluster algebras
• The squish map and the \(\mathrm{SL}_2\) double dimer model
• Mixed dimer configuration model in Type \(D\) cluster algebras. II: Beyond the acyclic case
• Holographic tensor network for double-scaled SYK
• Planar UST branches and c = -2 degenerate boundary correlations
• Fused Specht polynomials and c=1 degenerate conformal blocks
• The monopole-dimer model on high-dimensional cylindrical, toroidal, Möbius and Klein grids
• Exact solution of the 2d dimer model: corner free energy, correlation functions and combinatorics

This page was built for publication: Double-dimer pairings and skew Young diagrams

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q547790)