State matrix recursion method and monomer-dimer problem

DOI10.1016/J.DISC.2019.01.022MaRDI QIDQ1732778zbMATH OpenOpenAlexWikidataFDO

Authors Seungsang Oh

Publication date 25 March 2019

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1901.07847

zbMATH Keywords

domino tilingdimerHosoya indexAztec diamond

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorial aspects of tessellation and tiling problems (05B45) Tilings in (2) dimensions (aspects of discrete geometry) (52C20)

Abstract: The exact enumeration of pure dimer coverings on the square lattice was obtained by Kasteleyn, Temperley and Fisher in 1961. In this paper, we consider the monomer-dimer covering problem (allowing multiple monomers) which is an outstanding unsolved problem in lattice statistics. We have developed the state matrix recursion method that allows us to compute the number of monomer--dimer coverings and to know the partition function with monomer and dimer activities. This method proceeds with a recurrence relation of so-called state matrices of large size. The enumeration problem of pure dimer coverings and dimer coverings with single boundary monomer is revisited in partition function forms. We also provide the number of dimer coverings with multiple vacant sites. The related Hosoya index and the asymptotic behavior of its growth rate are considered. Lastly, we apply this method to the enumeration study of domino tilings of Aztec diamonds and more generalized regions, so-called Aztec octagons and multi-deficient Aztec octagons.

Recommendations

• Dimer coverings of 1-slab cubic lattices
• scientific article; zbMATH DE number 2046050
• Approximating the number of monomer-dimer coverings of a lattice.
• scientific article; zbMATH DE number 3887745
• The statistics of dimers on a lattice. I: The number of dimer arrangements on a quadratic lattice

Cites work

• scientific article; zbMATH DE number 3461953 (Why is no real title available?)
• scientific article; zbMATH DE number 1405497 (Why is no real title available?)
• scientific article; zbMATH DE number 3257906 (Why is no real title available?)
• scientific article; zbMATH DE number 3326387 (Why is no real title available?)
• A simple proof of the Aztec diamond theorem
• Alternating-sign matrices and domino tilings. I
• Dimer problem in statistical mechanics-an exact result
• Dimers on a simple-quartic net with a vacancy
• Enumerating independent vertex sets in grid graphs
• Enumeration of structure-sensitive graphical subsets: Theory
• Enumeration on graph mosaics
• Matching theory
• Maximal independent sets on a grid graph
• Period and toroidal knot mosaics
• Quantum knot mosaics and the growth constant
• Quantum knots and mosaics
• Quantum knots and the number of knot mosaics
• Remark on the dimer problem
• Small knot mosaics and partition matrices
• Statistical Mechanics of Dimers on a Plane Lattice
• The statistics of dimers on a lattice. I: The number of dimer arrangements on a quadratic lattice
• Theory of monomer-dimer systems

Cited in

(12)

• Enumerating maximal dissociation sets in three classes of grid graphs
• Using edge generating function to solve monomer-dimer problem
• scientific article; zbMATH DE number 2046050 (Why is no real title available?)
• Counting dissections into integral squares
• Counting domineering positions
• Augmented Aztec bipyramid and dicube tilings
• Dimer coverings of 1-slab cubic lattices
• Domino tilings of the expanded Aztec diamond
• Enumeration of 1-slab lattice links
• Quantum knot mosaics and bounds of the growth constant
• Domino tilings of Aztec octagons
• Number of dominating sets in cylindric square grid graphs

This page was built for publication: State matrix recursion method and monomer-dimer problem

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