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

DOI10.1063/1.526778MaRDI QIDQ3711991zbMATH OpenOpenAlexFDO

Authors Haruo Hosoya, Akiko Motoyama

Publication date 1985

Published in Journal of Mathematical Physics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1063/1.526778

zbMATH Keywords

arbitrary number of indistinguishable dumbbellsdimer statisticsKekulé numbersnonadjacent numberoperator techniquePerfect matching numbersrectangular lattice spacesRecursion formulastorus spaces

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Foundations, constitutive equations, rheology, hydrodynamical models of non-fluid phenomena (76A99) Classical equilibrium statistical mechanics (general) (82B05)

Recommendations

• The statistics of dimers on a lattice. I: The number of dimer arrangements on a quadratic lattice
• scientific article; zbMATH DE number 4183429
• Dimer problem for some three dimensional lattice graphs
• scientific article; zbMATH DE number 3887745
• Generalized expression of the perfect matching number for 2×3×n lattices

Cites work

• Dimer problem in statistical mechanics-an exact result
• Domino tilings of rectangles with fixed width
• King and domino polynomials for polyomino graphs
• Occupation statistics from exact recursion relations for occupation by dumbbells of a 2 × N array
• The statistics of dimers on a lattice. I: The number of dimer arrangements on a quadratic lattice

Cited in

(12)

• On some counting polynomials in chemistry
• Notes on the asymptotic linearity theorems
• Expressions for the perfect matching numbers of cubic l m n lattices and their asymptotic values
• Resonance in elemental benzenoids
• Orthogonal polynomials through complex matrix graph theory
• Generalized expression for the numbers of perfect matching of cylindrical m×n graphs
• Generalized expression of the perfect matching number for 2×3×n lattices
• The number of domino matchings in the game of memory
• scientific article; zbMATH DE number 5030014 (Why is no real title available?)
• The implementation of Hosoya index and Hosoya polynomial into some graphs related to cycles
• An expression for the perfect matching number of cubic \(2\times m\times n\) lattices and their asymptotic values
• On ``The matching polynomial of a polygraph

This page was built for publication: 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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3711991)