Dimers, tilings and trees

Journal of Combinatorial Theory. Series B

Volumn 92, Issue 2 SPEC. ISS., 2004, Pages 295-317

  Kenyon, Richard W ^a   Sheffield, Scott ^b  

^a UNIVERSITY OF BRITISH COLUMBIA   (Canada)

^b MICROSOFT RESEARCH   (United States)

Author keywords

Dimers; Perfect matchings; Polygon tilings; Spanning trees

Indexed keywords

EID: 9144254727     PISSN: 00958956     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jctb.2004.07.001     Document Type: Article

References (12)

1. R.L. Brooks C.A.B. Smith A.H. Stone W.T. Tutte Dissecting a rectangle into squares Duke Math. J. 7 1940 312-340
2. R. Burton R. Pemantle Local characteristics, entropy and limit theorems for uniform spanning trees and domino tilings via transfer-impedances Ann. Probab. 21 1993 1329-1371
3. R.J. Duffin Basic properties of discrete analytic functions Duke Math J. 23 1956 335-363
4. P. Kasteleyn Graph theory and crystal physics in: Graph Theory and Theoretical Physics 1967 Academic Press London 43-110
5. R. Kenyon The Laplacian and Dirac operators on critical planar graphs Invent. Math. 150 2002 409-439
6. R. Kenyon Conformal invariance of domino tiling Ann. Probab. 28 2000 759-795
7. R. Kenyon Tilings and discrete Dirichlet problems Israel. J. Math 105 1998 61-84
8. R. Kenyon Height fluctuations in the lozenge tiling model arXiv:mAth-ph/0405052
9. R. Kenyon, A. Okounkov S. Sheffield, Dimers and Amoebae, Ann. Math., to appear, arXiv:mAth-ph/0311005
10. R. Kenyon J. Propp D. Wilson Trees and Matchings Electron. J. Combin. 7 2000 Research paper 25, 34pp.
11. H. Temperley Combinatorics: Proceedings of the British Combinatorial Conference 1973 London Mathematical Society Lecture Notes Series vol. 13 1974 pp. 202-204
12. D. Wilson Generating random spanning trees more quickly than the cover time. Proceedings of the 28th Annual ACM Symposium on the Theory of Computing, Philadelphia, PA, 1996, ACM, New York, 1996, pp. 296-303