Squareness for the monopole-dimer model
From MaRDI portal
Publication:2189558
Abstract: The monopole-dimer model introduced recently is an exactly-solvable signed generalisation of the dimer model. We show that the partition function of the monopole-dimer model on a graph invariant under a fixed-point free involution is a perfect square. We give a combinatorial interpretation of the square-root of the partition function for such graphs in terms of a monopole-dimer model on a new kind of graph with two types of edges which we call a dicot. The partition function of the latter can be written as a determinant, this time of a complex adjacency matrix. This formulation generalises T. T. Wu's assignment of imaginary orientation for the grid graph to planar dicots. As an application, we compute the partition function for a family of non-planar dicots with positive weights.
Recommendations
- The monopole-dimer model for Cartesian products of graphs: extended abstract
- A statistical model of current loops and magnetic monopoles
- A Pfaffian formula for the monomer-dimer model on surface graphs
- A Pfaffian formula for monomer-dimer partition functions
- The planar dimer model boundary: A survey
Cites work
- scientific article; zbMATH DE number 3427740 (Why is no real title available?)
- A Pfaffian formula for monomer-dimer partition functions
- A statistical model of current loops and magnetic monopoles
- Determinants and perfect matchings
- Dimers on Rectangular Lattices
- Enumeration of perfect matchings in graphs with reflective symmetry
- Local statistics of lattice dimers
- On the eigenvalue problem for Toeplitz band matrices
- Perfect matchings and perfect squares
- The statistics of dimers on a lattice. I: The number of dimer arrangements on a quadratic lattice
Cited in
(4)
This page was built for publication: Squareness for the monopole-dimer model
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2189558)