An asymptotic expansion and recursive inequalities for the monomer-dimer problem

DOI10.1007/s10955-011-0170-6zbMath1216.82063arXiv1011.6579OpenAlexW1983479310MaRDI QIDQ540587

Paul Federbush, Shmuel Friedland

Publication date: 3 June 2011

Published in: Journal of Statistical Physics (Search for Journal in Brave)

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

zbMATH Keywords

monomer-dimer entropiesrecursive inequalities

Mathematics Subject Classification ID

Statistical mechanics of polymers (82D60)

Related Items (5)

Positivity of the virial coefficients in lattice dimer models and upper bounds on the number of matchings on graphs ⋮ \(1/n\) expansion for the number of matchings on regular graphs and Monomer-Dimer entropy ⋮ Asymptotic expansions for \(\lambda _{d }\) of the dimer and monomer-dimer problems ⋮ Matchings in vertex-transitive bipartite graphs ⋮ A positivity property of the dimer entropy of graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Computation of terms in the asymptotic expansion of dimer \(\lambda_d\) for high dimension
• On the validations of the asymptotic matching conjectures
• Proof of the van der Waerden conjecture regarding the permanent of a doubly stochastic matrix
• Asymptotic expansions for \(\lambda _{d }\) of the dimer and monomer-dimer problems
• An improved upper bound for the \(3\)-dimensional dimer problem
• Theory of computation of multidimensional entropy with an application to the monomer-dimer problem
• The statistics of dimers on a lattice
• Statistical Mechanics of Dimers on a Plane Lattice
• An asymptotic solution of the multidimensional dimer problem
• A Lower Bound for the Monomer-Dimer Problem

This page was built for publication: An asymptotic expansion and recursive inequalities for the monomer-dimer problem