An exploration of the permanent-determinant method

Electronic Journal of Combinatorics

Volumn 5, Issue 1, 1998, Pages

  Kuperberg, Greg ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 4043180737     PISSN: 10778926     EISSN: None     Source Type: Journal    
DOI: 10.37236/1384     Document Type: Article

References (45)

1. K. Al-Khnaifes and H. Sachs. Graphs, linear equations, determinants, and the number of perfect matchings. In Contemporary methods in graph theory, pages 47-71. Bibliographisches Inst., Mannheim, 1990.
2. G. Andrews. Plane partitions V: The T. S. S. C. P. P. conjecture. J. Combin. Theory Ser. A, 66:28-39, 1994.
3. G. E. Andrews and W. H. Burge. Determinant identities. Pacific J. Math., 158:1-14, 1993.
4. M. Ciucu. Plane partitions I: A generalization of MacMahon's formula. math.CO/9808017.
5. M. Ciucu. Enumeration of perfect matchings in graphs with reflective symmetry. J. Combin. Theory Ser. A, 77:67-97, 1997.
6. M. Ciucu. Enumeration of lozenge tilings of punctured hexagons. J. Combin. Theory Ser. A, 83:268-272, 1998.
7. M. Ciucu and C. Krattenthaler. Plane partitions II: 5 1/2 symmetry classes. math.CO/9808018.
8. H. Cohn, M. Larsen, and J. Propp. The shape of a typical boxed plane partition. New York J. Math., 4:137-165, 1998, math.CO/9801059.
9. N. Elkies, G. Kuperberg, M. Larsen, and J. Propp. Alternating-sign matrices and domino tilings, I. J. Algebraic Combin., 1(2):111-132, 1992.
10. N. Elkies, G. Kuperberg, M. Larsen, and J. Propp. Alternating-sign matrices and domino tilings, II. J. Algebraic Combin., 1(3):219-234, 1992.
11. I. Gessel and G. Viennot. Binomial determinants, paths, and hook lengthformulas. Adv. in Math., 58:300-321, 1985.
12. I. Gessel and G. Viennot. Determinants, paths, and plane partitions. Preprint, 1989.
13. H. Helfgott and I. M. Gessel. Enumeration of tilings of diamonds and hexagons with defects. math.CO/9810143.
14. C. A. Hurst and H. S. Green. New solution of the Ising problem for a rectangular lattice. Journal of Chemical Physics, 33:1059-1062, 1960.
15. W. Jockusch. Perfect matchings and perfect squares. J. Combin. Theory Ser. A, 67:100-115, 1994.
16. W. Jockusch, J. Propp, and P. Shor. Random domino tilings and the arctic circle theorem. math.CO/9801068.
17. M. Kac and J. C. Ward. A combinatorial solution of the two-dimensional Ising model. Physical Review, 88:1332-1337, 1952.
18. P. W. Kasteleyn. Graph theory and crystal physics. In F. Harary, editor, Graph Theory and Theoretical Physics. Academic Press, 1967.
19. R. Kenyon. Local statistics of lattice dimers. Ann. Inst. H. Poincaré, Probabilités, 33:591-618, 1997.
20. C. Krattenthaler. Determinant identities and a generalization of the number of totally symmetric self-complementary plane partitions. math.CO/9712202.
21. G. Kuperberg. Symmetries of plane partitions and the permanent- determinant method. J. Combin. Theory Ser. A, 68(1):115-151, 1994.
22. G. Kuperberg. Four symmetry classes of plane partitions under one roof. J. Combin. Theory Ser. A, 75(2):295-315, 1996.
23. B. Lindström. On the vector representations of induced matroids. Bull. London Math. Soc., 5:85-90, 1973.
24. C. H. C. Little. An extension of Kasteleyn's method of enumerating the 1-factors of planar graphs. In Combinatorial Mathematics (Proc. Second Australian Conf., Univ. Melbourne, Melbourne, 1973), volume 403 of Lecture Notes in Mathematics, pages 63-72, 1974.
25. W. H. Mills, D. P. Robbins, and H. Rumsey. Proof of the Macdonald conjecture. Invent. Math., 66:73-87, 1982.
26. G. F. Newell and E. W. Montroll. On the theory of the Ising model of ferromagnetism. Reviews of Modern Physics, 25:353-389, 1953.
27. S. Okada. On the generating functions for certain classes of plane partitions. J. Combin. Theory A, 51:1-23, 1989.
28. S. Okada and C. Krattenthaler. The number of rhombus tilings of a "punctured" hexagon and the minor summation formula. math.CO/9712203.
29. L. Onsager. Crystal statistics. I. A two-dimensional model with an order-disorder transition. Phys. Rev., 65:117-149, 1944.
30. J. Percus. One more technique for the dimer problem. Journal of Mathematical Physics, 10:1881-1888, 1969.
31. J. Propp. Twenty open problems in enumeration of matchings. math.CO/9801060.
32. M. Rasetti and T. Regge. Dimer covering and Ising model on lattices homogeneous under the icosahedral group. Riv. Nuovo Cimento, 4:1-34, 1981.
33. N. Yu. Reshetikhin and V. G. Turaev. Ribbon graphs and their invariants derived from quantum groups. Comm. Math. Phys., 127:1-26, 1990.
34. N. Robertson, P. D. Seymour, and R. Thomas. Permanents, Pfaffian orientations, and even directed circuits. Preprint, 1997.
35. S. Sherman. Combinatorial aspects of the Ising model for ferromagnetism I. A conjecture of Feynman on paths and graphs. J. Math. Phys., 1:202-217, 1960.
36. R. P. Stanley. Symmetries of plane partitions. J. Combin. Theory Ser. A, 43:103-113, 1986.
37. J. Stembridge. Strange enumerations of CSPP's and TSPP's. Preprint.
38. J. Stembridge. The enumeration of totally symmetric plane partitions. Advances in Math., 111:227-243, 1995.
39. J. R. Stembridge. Non-intersecting paths, Pfaffians, and plane partitions. Advances in Math., 83:96-131, 1990.
40. G. Tesler. Matchings in graphs on non-oriented surfaces. In preparation.
41. G. Tesler. Private communication.
42. 60. Adv. in Appl. Math., 14:217-225, 1993.
43. L. Valiant. The complexity of computing the permanent. Theoret. Comput. Sci., 8:189-201, 1979.
44. T. Van Zandt. Pstricks: PostScript macros for generic TEX. Available from CTAN.
45. B.-Y. Yang. Two enumeration problems about the Aztec diamonds. PhD thesis, Massachusetts Institute of Technology, 1991.