Add to ORKGWe consider Kasteleyn and Kasteleyn-Percus matrices, which arise in enumerating matchings of planar graphs, up to matrix operations on their rows and columns
The permanent-determinant method and its generalization, the Hafnian-Pfaffian method, are m...
: The following problem, which stems from the "flux phase" problem in condensed matter phy...
AbstractThe Pfaffian method enumerating perfect matchings of plane graphs was discovered by Kasteley...
We consider Kasteleyn and Kasteleyn-Percus matrices, which arise in enumerating matchings o...
Maximal minors of Kasteleyn sign matrices on planar bipartite graphs in the disk count dimer configu...
AbstractWe generalize Kasteleyn's method of enumerating the perfect matchings in a planar graph to g...
AbstractIn 1961, P. W. Kasteleyn enumerated the domino tilings of a 2n × 2n chessboard. His answer w...
The spectra of the skew-adjacency matrices of a graph are considered as a possible way to distinguis...
Kasteleyn stated that the generating function of the perfect matchings of a graph of genus g may be ...
Abstract. We introduce a class of graphs called compound graphs, which are constructed out of copies...
AbstractThe spectra of the skew-adjacency matrices of a graph are considered as a possible way to di...
The Kac-Ward formula allows to compute the Ising partition function on a planar graph G with straigh...
The present article is designed to be a contribution to the chapter `Combinatorial Matrix Theory and...
AbstractRecently, Kenyon and Wilson introduced a certain matrix M in order to compute pairing probab...
Let S be a flat surface of genus g with cone type singularities. Given a bipartite graph G isoradial...
The permanent-determinant method and its generalization, the Hafnian-Pfaffian method, are m...
: The following problem, which stems from the "flux phase" problem in condensed matter phy...
AbstractThe Pfaffian method enumerating perfect matchings of plane graphs was discovered by Kasteley...
We consider Kasteleyn and Kasteleyn-Percus matrices, which arise in enumerating matchings o...
Maximal minors of Kasteleyn sign matrices on planar bipartite graphs in the disk count dimer configu...
AbstractWe generalize Kasteleyn's method of enumerating the perfect matchings in a planar graph to g...
AbstractIn 1961, P. W. Kasteleyn enumerated the domino tilings of a 2n × 2n chessboard. His answer w...
The spectra of the skew-adjacency matrices of a graph are considered as a possible way to distinguis...
Kasteleyn stated that the generating function of the perfect matchings of a graph of genus g may be ...
Abstract. We introduce a class of graphs called compound graphs, which are constructed out of copies...
AbstractThe spectra of the skew-adjacency matrices of a graph are considered as a possible way to di...
The Kac-Ward formula allows to compute the Ising partition function on a planar graph G with straigh...
The present article is designed to be a contribution to the chapter `Combinatorial Matrix Theory and...
AbstractRecently, Kenyon and Wilson introduced a certain matrix M in order to compute pairing probab...
Let S be a flat surface of genus g with cone type singularities. Given a bipartite graph G isoradial...
The permanent-determinant method and its generalization, the Hafnian-Pfaffian method, are m...
: The following problem, which stems from the "flux phase" problem in condensed matter phy...
AbstractThe Pfaffian method enumerating perfect matchings of plane graphs was discovered by Kasteley...