Dimers, tilings and trees
Dimers, tilings and trees
复制标题
DOI:
10.1016/j.jctb.2004.07.001
复制
发表时间:
2004-11-01
影响因子:
1.4
通讯作者:
Sheffield, S
中科院分区:
文献类型:
--
作者:
Kenyon, RW;Sheffield, S
Generalizing results of Temperley (London Mathematical Society Lecture Notes Series 13 (1974) 202), Brooks et al. (Duke Math. J. 7 (1940) 312) and others (Electron. J. Combin. 7 (2000); Israel J. Math. 105 (1998) 61) we describe a natural equivalence between three planar objects: weighted bipartite planar graphs; planar Markov chains; and filings with convex polygons. This equivalence provides a measure-preserving bijection between dimer coverings of a weighted bipartite planar graph and spanning trees of the corresponding Markov chain. The filings 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. (C) 2004 Published by Elsevier Inc.