An exploration of the permanent-determinant method
From MaRDI portal
Abstract: The permanent-determinant method and its generalization, the Hafnian-Pfaffian method, are methods to enumerate perfect matchings of plane graphs that was discovered by P. W. Kasteleyn. We present several new techniques and arguments related to the permanent-determinant with consequences in enumerative combinatorics. Here are some of the results that follow from these techniques: 1. If a bipartite graph on the sphere with 4n vertices is invariant under the antipodal map, the number of matchings is the square of the number of matchings of the quotient graph. 2. The number of matchings of the edge graph of a graph with vertices of degree at most 3 is a power of 2. 3. The three Carlitz matrices whose determinants count a x b x c plane partitions all have the same cokernel. 4. Two symmetry classes of plane partitions can be enumerated with almost no calculation.
Recommendations
- Enumeration of perfect matchings of graphs with reflective symmetry by Pfaffians
- How to calculate the number of perfect matchings in finite sections of certain infinite plane graphs
- A note on the number of perfect matchings of bipartite graphs
- Symmetries of plane partitions and the permanent-determinant method
Cited in
(41)- Kasteleyn cokernels
- Dimers on surface graphs and spin structures. I
- Spin from defects in two-dimensional quantum field theory
- Isoradial immersions
- (--1)-enumeration of plane partitions with complementation symmetry
- Dimers on surface graphs and spin structures. II
- Quadri-tilings of the plane
- Plane partitions of shifted double staircase shape
- Trivariate monomial complete intersections and plane partitions
- Enumeration of perfect matchings of graphs with reflective symmetry by Pfaffians
- Dimers on graphs in non-orientable surfaces
- Enumeration of Lozenge tilings of hexagons with a central triangular hole
- Miquel dynamics, Clifford lattices and the dimer model
- Discrete Dirac operators on Riemann surfaces and Kasteleyn matrices
- Pólya convertibility problem for symmetric matrices
- The number of rhombus tilings of a symmetric hexagon which contain a fixed rhombus on the symmetry axis. II
- Determinants and perfect matchings
- The combinatorial formula for open gravitational descendents
- Generalized domino-shuffling.
- Efficiently computing the permanent and Hafnian of some banded Toeplitz matrices
- A Schur function identity related to the \((-1)\)-enumeration of self-complementary plane partitions
- Enumeration of perfect matchings in graphs with reflective symmetry
- Elliptic dimers on minimal graphs and genus 1 Harnack curves
- Advanced determinant calculus: a complement
- The \(Z\)-Dirac and massive Laplacian operators in the \(Z\)-invariant Ising model
- A Riccati differential equation and free subgroup numbers for lifts of \(\mathrm{PSL}_2(\mathbb Z)\) modulo prime powers
- scientific article; zbMATH DE number 5057518 (Why is no real title available?)
- Pseudo-centrosymmetric matrices, with applications to counting perfect matchings
- A factorization theorem for lozenge tilings of a hexagon with triangular holes
- Minimal bipartite dimers and higher genus Harnack curves
- The critical \(Z\)-invariant Ising model via dimers: Locality property
- The Schwarzian octahedron recurrence (dSKP equation) I: explicit solutions
- Enumeration of spanning trees of graphs with rotational symmetry
- Kasteleyn cokernels and perfect matchings on planar bipartite graphs
- Pfaff's method. I: The Mills-Robbins-Rumsey determinant.
- The \(Z\)-invariant Ising model via dimers
- Graph coverings and twisted operators
- Symmetries of shamrocks. IV: The self-complementary case
- Chip removal for computing the number of perfect matchings
- Discrete Dirac operators, critical embeddings and Ihara-Selberg functions
- Dehn coloring and the dimer model for knots
This page was built for publication: An exploration of the permanent-determinant method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1271415)
