We consider Kasteleyn and Kasteleyn-Percus matrices, which arise in enumerating matchings of planar graphs, up to matrix operations on their rows and columns. If such a matrix is defined over a principal ideal domain, this is equivalent to considering its Smith normal form or its cokernel. Many variations of the enumeration methods result in equivalent matrices. In particular, Gessel-Viennot matrices are equivalent to Kasteleyn-Percus matrices. We apply these ideas to plane partitions and related planar of tilings. We list a number of conjectures, supported by experiments in Maple, about the forms of matrices associated to enumerations of plane partitions and other lozenge tilin...
AbstractRecently, Kenyon and Wilson introduced a certain matrix M in order to compute pairing probab...
In 1961, P. W. Kasteleyn enumerated the domino tilings of a 2n x 2n chessboard. His answer was alw...
Maximal minors of Kasteleyn sign matrices on planar bipartite graphs in the disk count dimer configu...
We consider Kasteleyn and Kasteleyn-Percus matrices, which arise in enumerating matchings of planar...
In previous paper, the author applied the permanent-determinant method of Kasteleyn and its...
AbstractIn 1961, P. W. Kasteleyn enumerated the domino tilings of a 2n × 2n chessboard. His answer w...
AbstractR. P. Stanley (1986, J. Combin. Theory Ser. A43, 103–113) gives formulas for the number of p...
We show how to count tilings of Aztec diamonds and hexagons with defects using determinants. In seve...
In the paper [J. Combin. Theory Ser. A 43 (1986), 103--113], Stanley gives formulas for the...
International audienceCylindric plane partitions may be thought of as a natural generalization of re...
We look into the rich combinatorics of fully-packed loop configurations (or FPL, or alternating-sign...
. A plane graph is called symmetric if it is invariant under the reflection across some straight lin...
AbstractLet B be a partially ordered product of three finite chains. For any group G of automorphism...
We study three types of polytopes occurring in combinatorial representation theory. The first two ar...
Abstract. We introduce a class of graphs called compound graphs, which are constructed out of copies...
AbstractRecently, Kenyon and Wilson introduced a certain matrix M in order to compute pairing probab...
In 1961, P. W. Kasteleyn enumerated the domino tilings of a 2n x 2n chessboard. His answer was alw...
Maximal minors of Kasteleyn sign matrices on planar bipartite graphs in the disk count dimer configu...
We consider Kasteleyn and Kasteleyn-Percus matrices, which arise in enumerating matchings of planar...
In previous paper, the author applied the permanent-determinant method of Kasteleyn and its...
AbstractIn 1961, P. W. Kasteleyn enumerated the domino tilings of a 2n × 2n chessboard. His answer w...
AbstractR. P. Stanley (1986, J. Combin. Theory Ser. A43, 103–113) gives formulas for the number of p...
We show how to count tilings of Aztec diamonds and hexagons with defects using determinants. In seve...
In the paper [J. Combin. Theory Ser. A 43 (1986), 103--113], Stanley gives formulas for the...
International audienceCylindric plane partitions may be thought of as a natural generalization of re...
We look into the rich combinatorics of fully-packed loop configurations (or FPL, or alternating-sign...
. A plane graph is called symmetric if it is invariant under the reflection across some straight lin...
AbstractLet B be a partially ordered product of three finite chains. For any group G of automorphism...
We study three types of polytopes occurring in combinatorial representation theory. The first two ar...
Abstract. We introduce a class of graphs called compound graphs, which are constructed out of copies...
AbstractRecently, Kenyon and Wilson introduced a certain matrix M in order to compute pairing probab...
In 1961, P. W. Kasteleyn enumerated the domino tilings of a 2n x 2n chessboard. His answer was alw...
Maximal minors of Kasteleyn sign matrices on planar bipartite graphs in the disk count dimer configu...