Corpus ID: 119269234

Kasteleyn cokernels and perfect matchings on planar bipartite graphs

  title={Kasteleyn cokernels and perfect matchings on planar bipartite graphs},
  author={Libby Taylor},
  journal={arXiv: Combinatorics},
The determinant method of Kasteleyn gives a method of computing the number of perfect matchings of a planar bipartite graph. In addition, results of Bernardi exhibit a bijection between spanning trees of a planar bipartite graph and elements of its Jacobian. In this paper, we explore an analogue of Bernardi's results, providing a canonical simply transitive group action of the Kasteleyn cokernel of a planar bipartite graph on its set of perfect matchings, when the planar bipartite graph in… Expand

Figures from this paper


Trees and Matchings
It is shown that the weighted, directed spanning trees (often called arborescences) of any planar graph can be put into a one-to-one weight-preserving correspondence with the perfect matchings of a related planar graphs. Expand
Geometric bijections between spanning trees and break divisors
  • C. Yuen
  • Mathematics, Computer Science
  • J. Comb. Theory, Ser. A
  • 2017
A special class of geometric bijections that are called edge ordering maps, which have good algorithmic properties are introduced, which provide a new geometric method for constructingBijections in combinatorics. Expand
Kasteleyn Cokernels
  • G. Kuperberg
  • Mathematics, Computer Science
  • Electron. J. Comb.
  • 2002
It is conjecture that a qspecialization of a Jacobi-Trudi matrix has a Smith normal form, and the normal form of the matrix that appears in the enumeration of domino tilings of an Aztec diamond is found. Expand
Riemann-Roch Theory for Graph Orientations
It is shown that the Baker--Norine rank of a partially orientable divisor is one less than the minimum number of directed paths which need to be reversed in the generalized cycle--cocycle reversal system to produce an acyclic partial orientation. Expand
A Characterization of the Tutte Polynomial via Combinatorial Embeddings
Abstract.We give a new characterization of the Tutte polynomial of graphs. Our characterization is formally close (but inequivalent) to the original definition given by Tutte as the generatingExpand
Critical groups of graphs with dihedral actions
It is shown that if the orbits of the D"n-action all have either n or 2n points then the critical group of such a graph can be decomposed in terms of the critical groups of the quotients of the graph by certain subgroups of the automorphism group. Expand
The Complexity of Computing the Permanent
  • L. Valiant
  • Computer Science, Mathematics
  • Theor. Comput. Sci.
  • 1979
Abstract It is shown that the permanent function of (0, 1)-matrices is a complete problem for the class of counting problems associated with nondeterministic polynomial time computations. RelatedExpand
Critical groups of graphs. Available at̃einer/HonorsTheses/Jacobson thesis.pdf
  • 2016