Combinatorics of tripartite boundary connections for trees and dimers
From MaRDI portal
Publication:2380271
zbMath1225.60020arXiv0811.1766MaRDI QIDQ2380271
Richard W. Kenyon, David Bruce Wilson
Publication date: 26 March 2010
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0811.1766
Trees (05C05) Combinatorial probability (60C05) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics (82B20)
Related Items (8)
The planar Ising model and total positivity ⋮ Hitting matrix and domino tiling with diagonal impurities ⋮ The Space of Circular Planar Electrical Networks ⋮ Dungeons and dragons: combinatorics for the \(dP_3\) quiver ⋮ Pfaffian Formulas for Spanning Tree Probabilities ⋮ Combinatorics of the double-dimer model ⋮ Combinatorics of the double-dimer model ⋮ Boundary partitions in trees and dimers
This page was built for publication: Combinatorics of tripartite boundary connections for trees and dimers