A Lower Bound for the Monomer-Dimer Problem

DOI10.1093/IMAMAT/6.4.341MaRDI QIDQ5628139zbMATH OpenOpenAlexFDO

Authors J. M. Hammersley, V. V. Menon

Publication date 1970

Published in IMA Journal of Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1093/imamat/6.4.341

Mathematics Subject Classification ID

Combinatorial aspects of tessellation and tiling problems (05B45)

Cited in

(13)

• On the validations of the asymptotic matching conjectures
• Sequential cavity method for computing free energy and surface pressure
• Approximating the number of monomer-dimer coverings of a lattice.
• Asymptotic expansions for \(\lambda _{d }\) of the dimer and monomer-dimer problems
• Theory of monomer-dimer systems
• A statistical model of current loops and magnetic monopoles
• Theory of computation of multidimensional entropy with an application to the monomer-dimer problem
• Statistical Matching Theory
• Some Recurrence Relations of Recursive Minimization
• An asymptotic expansion and recursive inequalities for the monomer-dimer problem
• The monopole-dimer model for Cartesian products of graphs: extended abstract
• The monopole-dimer model on Cartesian products of plane graphs
• Matching measure, Benjamini-Schramm convergence and the monomer-dimer free energy

This page was built for publication: A Lower Bound for the Monomer-Dimer Problem

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