Dimers, tilings and trees

From MaRDI portal
Publication:705883

DOI10.1016/J.JCTB.2004.07.001zbMATH Open1055.05032arXivmath/0310195OpenAlexW1977168065MaRDI QIDQ705883FDOQ705883


Authors: Richard Kenyon, Scott Sheffield Edit this on Wikidata


Publication date: 16 February 2005

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Abstract: Generalizing results of Temperley, Brooks, Smith, Stone and Tutte and others we describe a natural equivalence between three planar objects: weighted bipartite planar graphs; planar Markov chains; and tilings with convex polygons. This equivalence provides a measure-preserving bijection between dimer coverings of a weighted bipartite planar graph and spanning trees on the corresponding Markov chain. The tilings correspond to harmonic functions on the Markov chain and to ``discrete analytic functions on the bipartite graph. The equivalence is extended to infinite periodic graphs, and we classify the resulting ``almost periodic tilings and harmonic functions.


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




Recommendations




Cites Work


Cited In (29)





This page was built for publication: Dimers, tilings and trees

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