Generalized expression of the perfect matching number for 2×3×n lattices
DOI10.1063/1.530236zbMATH Open0773.60092OpenAlexW1995970120MaRDI QIDQ4201771FDOQ4201771
Authors: Hideyuki Narumi, Haruo Hosoya 
Publication date: 6 September 1993
Published in: Journal of Mathematical Physics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1063/1.530236
Recommendations
- An expression for the perfect matching number of cubic \(2\times m\times n\) lattices and their asymptotic values
- Expressions for the perfect matching numbers of cubic \(l\times m\times n\) lattices and their asymptotic values
- Dimer problem for some three dimensional lattice graphs
- Generalized expression for the numbers of perfect matching of cylindrical m×n graphs
- On the dimer problem and the Ising problem in finite \(3\)-dimensional lattices
Interacting random processes; statistical mechanics type models; percolation theory (60K35) Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics (82B20)
Cites Work
- The statistics of dimers on a lattice. I: The number of dimer arrangements on a quadratic lattice
- Dimer problem in statistical mechanics-an exact result
- An effective algorithm for obtaining polynomials for dimer statistics. Application of operator technique on the topological index to two- and three-dimensional rectangular and torus lattices
- Generalized expression for the numbers of perfect matching of cylindrical m×n graphs
- Kasteleyn's Theorem and Arbitrary Graphs
- A note on the occupational degeneracy for dimers on a saturated two- dimensional lattice space
Cited In (3)
- Expressions for the perfect matching numbers of cubic \(l\times m\times n\) lattices and their asymptotic values
- An effective algorithm for obtaining polynomials for dimer statistics. Application of operator technique on the topological index to two- and three-dimensional rectangular and torus lattices
- An expression for the perfect matching number of cubic \(2\times m\times n\) lattices and their asymptotic values
This page was built for publication: Generalized expression of the perfect matching number for 2×3×n lattices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4201771)
