Trees and matchings

From MaRDI portal
Revision as of 16:40, 1 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:1977372

zbMath0939.05066arXivmath/9903025MaRDI QIDQ1977372

James Propp, Richard W. Kenyon, David Bruce Wilson

Publication date: 11 May 2000

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

Full work available at URL: https://arxiv.org/abs/math/9903025




Related Items (48)

Conformal invariance of domino tiling.Dominos and the Gaussian free field.Weighted graphs, spanning tree generating functions and anisotropic lattice systems: illustrative results for the Ising and dimer modelsLocal geometry of the rough-smooth interface in the two-periodic Aztec diamondStatistics of close-packed dimers on fractal latticesTwists of Plücker coordinates as dimer partition functionsThe triangular kagomé lattices revisitedDimers and imaginary geometryDouble-dimers, the Ising model and the hexahedron recurrenceQuantitative Russo-Seymour-Welsh for random walk on random graphs and decorrelation of uniform spanning treesCritical varieties in the GrassmannianFiltered simplicial homology, graph dissimilarity and überhomologyFree boundary dimers: random walk representation and scaling limitReconstruction of domino tilings -- combinatorial and probabilistic questionsOn the Number of α-OrientationsThe Schwarzian octahedron recurrence (dSKP equation) I: explicit solutionsSpectra of biperiodic planar networksEnumeration of spanning trees of graphs with rotational symmetryFlips on homologous orientations of surface graphs with prescribed forbidden facial cyclesPrincipal minors Pfaffian half-tree theoremConformal invariance of loops in the double-dimer modelStationary determinantal processes: phase multiplicity, Bernoullicity, entropy, and dominationKauffman's clock lattice as a graph of perfect matchings: a formula for its heightMixing times of lozenge tiling and card shuffling Markov chainsSymmetry classes of spanning trees of aztec diamonds and perfect matchings of odd squares with a unit holeSpotlight tilingThe Green's function on the double cover of the grid and application to the uniform spanning tree trunkTransfer matrix for spanning trees, webs and colored forestsHaldane relation for interacting dimersSpanning trees and recurrent configurations of a graphThe asymptotic determinant of the discrete LaplacianThe height fluctuations of an off-critical dimer model on the square gridSandpiles and dominosDimers, tilings and treesA bijection theorem for domino tilings with diagonal impuritiesThe free-fermionic \(C_2^{(1)}\) loop model, double dimers and Kashaev's recurrenceSLE and the free field: Partition functions and couplingsElectroid varieties and a compactification of the space of electrical networksChannels, billiards, and perfect matching 2-divisibilityA discrete Morse perspective on knot projections and a generalised clock theoremHeight fluctuations in the honeycomb dimer modelThe \(Z\)-Dirac and massive Laplacian operators in the \(Z\)-invariant Ising modelEnumerating spanning trees of graphs with an involutionHow quickly can we sample a uniform domino tiling of the \(2L\times 2L\) square via Glauber dynamics?Dimers and families of Cauchy-Riemann operators IAsymptotics of height change on toroidal Temperleyan dimer modelsLozenge tilings, Glauber dynamics and macroscopic shapeAsymptotics for the determinant of the combinatorial Laplacian on hypercubic lattices







This page was built for publication: Trees and matchings