Logo
ScienceStack
Table of Contents
Fetching ...
Sign In

A Generalized Grassmann-Pfaffian Framework for Monomer-Dimer and Spanning Trees

E. A. Ramirez Trino, M. A. Seifi MirJafarlou, M. A. Rajabpour

TL;DR

This work develops a comprehensive Grassmann–Berezin framework that unifies combinatorial graph models (dimers, monomer–dimers, spanning trees/forests) with fermionic and bosonic source insertions. It delivers two master identities for real and complex fermions with mixed sources, enabling determinant- and Pfaffian-based representations even when underlying matrices are singular. The Monobisyzexant (Mbsz) generalizes Hafnian to monomer-containing graphs, with Hua decomposition handling fixed-monomer and singular cases; spanning trees/forests are represented via source-ordered Berezin integrals and spectral regularization. Collectively, the framework translates classical combinatorial counts into tractable Grassmann integrals, linking Hafnians to Pfaffians, extending Kasteleyn’s method to monomer–dimer systems, and offering robust tools for lattice field theories and graph-based computations.

Abstract

We develop a unified framework for Berezin integrals over Grassmann variables that establishes master identities for exponential quadratic fermionic forms and linear fermionic forms coupled to both bosonic and fermionic sources. The construction is rigorous for both real and complex fermions in arbitrary dimensions and remains well-defined even when the underlying matrices are singular. Our main mathematical results appear in two master theorems. Theorem 12 provides a comprehensive identity for Berezin integrals over Grassmann variables for real fermions with mixed bosonic-fermionic sources, applicable to any antisymmetric matrix. Its complex analogue, Theorem 13, yields corresponding determinant-based representations. Together, they serve as generating functionals for a wide range of combinatorial and physical models. Key applications include the dimer, monomer-dimer, matching, and almost-matching problems. We revisit the Kasteleyn theorem for planar dimers using Berezin integrals. We construct monomer-dimer systems through the \textit{Monobisyzexant (Mbsz)} function, which generalizes the Hafnian to incorporate monomer contributions and admits a Pfaffian-sum representation for planar graphs (Theorem 5); and practical techniques for handling singular matrices via unitary block decomposition (Theorem 6) and spectral analysis. We further present explicit mappings between Hafnians and Pfaffians and their submatrix generalizations (Hafnianinhos and Pfaffianinhos); an alternative source-ordered Berezin integral representation for spanning trees and forests using complex bosonic sources that regularizes the Laplacian zero mode (Theorem 10). Overall, this work offers a flexible toolkit for the theoretical analysis and computational implementation of graph-based models and lattice field theories using Berezin integrals over Grassmann variables .

A Generalized Grassmann-Pfaffian Framework for Monomer-Dimer and Spanning Trees

TL;DR

This work develops a comprehensive Grassmann–Berezin framework that unifies combinatorial graph models (dimers, monomer–dimers, spanning trees/forests) with fermionic and bosonic source insertions. It delivers two master identities for real and complex fermions with mixed sources, enabling determinant- and Pfaffian-based representations even when underlying matrices are singular. The Monobisyzexant (Mbsz) generalizes Hafnian to monomer-containing graphs, with Hua decomposition handling fixed-monomer and singular cases; spanning trees/forests are represented via source-ordered Berezin integrals and spectral regularization. Collectively, the framework translates classical combinatorial counts into tractable Grassmann integrals, linking Hafnians to Pfaffians, extending Kasteleyn’s method to monomer–dimer systems, and offering robust tools for lattice field theories and graph-based computations.

Abstract

We develop a unified framework for Berezin integrals over Grassmann variables that establishes master identities for exponential quadratic fermionic forms and linear fermionic forms coupled to both bosonic and fermionic sources. The construction is rigorous for both real and complex fermions in arbitrary dimensions and remains well-defined even when the underlying matrices are singular. Our main mathematical results appear in two master theorems. Theorem 12 provides a comprehensive identity for Berezin integrals over Grassmann variables for real fermions with mixed bosonic-fermionic sources, applicable to any antisymmetric matrix. Its complex analogue, Theorem 13, yields corresponding determinant-based representations. Together, they serve as generating functionals for a wide range of combinatorial and physical models. Key applications include the dimer, monomer-dimer, matching, and almost-matching problems. We revisit the Kasteleyn theorem for planar dimers using Berezin integrals. We construct monomer-dimer systems through the \textit{Monobisyzexant (Mbsz)} function, which generalizes the Hafnian to incorporate monomer contributions and admits a Pfaffian-sum representation for planar graphs (Theorem 5); and practical techniques for handling singular matrices via unitary block decomposition (Theorem 6) and spectral analysis. We further present explicit mappings between Hafnians and Pfaffians and their submatrix generalizations (Hafnianinhos and Pfaffianinhos); an alternative source-ordered Berezin integral representation for spanning trees and forests using complex bosonic sources that regularizes the Laplacian zero mode (Theorem 10). Overall, this work offers a flexible toolkit for the theoretical analysis and computational implementation of graph-based models and lattice field theories using Berezin integrals over Grassmann variables .

Paper Structure

This paper contains 82 sections, 30 theorems, 238 equations, 4 figures.

Table of Contents

  1. Introduction
  2. The dimer model, Planar dimers, and Pfaffian Techniques I
  3. The Hafnian and the dimer model
  4. From Hafnian to Kasteleyn Pfaffian and the Planar dimer model
  5. Planar dimer model
  6. The Monomer--Dimer Model, Planar Monomer-Dimer model, and Pfaffian Techniques II
  7. The monomer--dimer model
  8. From Monobisyzexant to Modified Kasteleyn Pfaffians and the Planar monomer-dimer model
  9. Planar dimer with fixed monomers model
  10. Modified Kasteleyn Matrix $\mathbf{K}'$ for Rectangular Lattices:
  11. Monomer Projection Matrix $\mathbf{H}$:
  12. Correlation Function and Disorder Operators:
  13. Planar dimer with monomer fugacity model
  14. Even $L$ (Perfect Matchings)
  15. Odd $L$ (Almost-Perfect Matchings)
  16. ...and 67 more sections

Key Result

Theorem 1

The partition function of the dimer model counts the total number of such coverings, that is, the number of perfect matchings of the graph. This partition function is given by where we define $(\Bar{\boldsymbol{\chi}}\boldsymbol{\chi})^\top:=$, $\mathbf{D}(\boldsymbol{\chi},\bar{\boldsymbol{\chi}}):=d\chi_1d\bar{\chi}_1\cdots d\chi_{2L}d\bar{\chi}_{2L}$, and $\operatorname{haf}(\mathbf{A})$ is th

Figures (4)

  • Figure 1: (Left) Original planar graph. (Right) Kasteleyn-oriented version with edge directions assigned to satisfy the odd clockwise orientation condition for each face.
  • Figure 2: (Left) Original square lattice graph. (Right) Kasteleyn-oriented lattice with edge directions satisfying the odd clockwise orientation condition for each face. For square lattices, a convenient construction assigns all vertical edges downward and alternates horizontal edges between left and right directions. Monomers are inserted at vertices $v_2$, $v_5$, $v_{17}$, and $v_{33}$ in the right graph.
  • Figure 3: Dimer configurations with bosonic sources. (a-c) For even vertex count, perfect matchings leave bosonic vertices unpaired. (d-g) For odd vertex count with fixed monomer at $v_1$, bosonic vertices form dimers with fermionic vertices, generating almost perfect matchings.
  • Figure 4: Weighted graph $W$ with vertices $(v_1,v_2,v_3,v_4,v_5)$ and weighted edges $(w_{12},w_{23},w_{24},w_{34},w_{45})$.

Theorems & Definitions (56)

  • Definition 1: Graph
  • Definition 2: Weighted adjacency matrix
  • Definition 3: Perfect Matching
  • Definition 4: Dimer (or Perfect Matching) Partition Function
  • Definition 5: Dimer (or Edge) Correlation Function
  • Definition 6: Monomer (or vertices) Correlation Function
  • Definition 7: Mixed Monomer--dimer Correlation Function
  • Theorem 1: Berezin integral over Grassmann variables representation of the dimer model Samuel1980Samuel1980b
  • Definition 8: Planar drawing and planar graph
  • Definition 9: Skew adjacency / Kasteleyn matrix for an orientation
  • ...and 46 more