An asymptotic expansion and recursive inequalities for the monomer-dimer problem
From MaRDI portal
Publication:540587
DOI10.1007/S10955-011-0170-6zbMATH Open1216.82063arXiv1011.6579OpenAlexW1983479310MaRDI QIDQ540587FDOQ540587
Publication date: 3 June 2011
Published in: Journal of Statistical Physics (Search for Journal in Brave)
Abstract: Let (lambda_d)(p) be the p monomer-dimer entropy on the d-dimensional integer lattice Z^d, where p in [0,1] is the dimer density. We give upper and lower bounds for (lambda_d)(p) in terms of expressions involving (lambda_(d-1))(q). The upper bound is based on a conjecture claiming that the p monomer-dimer entropy of an infinite subset of Z^d is bounded above by (lambda_d)(p). We compute the first three terms in the formal asymptotic expansion of (lambda_d)(p) in powers of 1/d. We prove that the lower asymptotic matching conjecture is satisfied for (lambda_d)(p).
Full work available at URL: https://arxiv.org/abs/1011.6579
Cites Work
- The statistics of dimers on a lattice. I: The number of dimer arrangements on a quadratic lattice
- Statistical Mechanics of Dimers on a Plane Lattice
- A Lower Bound for the Monomer-Dimer Problem
- Title not available (Why is that?)
- Proof of the van der Waerden conjecture regarding the permanent of a doubly stochastic matrix
- On the validations of the asymptotic matching conjectures
- Computation of terms in the asymptotic expansion of dimer \(\lambda_d\) for high dimension
- 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
- An asymptotic solution of the multidimensional dimer problem
- Title not available (Why is that?)
Cited In (9)
- A positivity property of the dimer entropy of graphs
- Positivity of the virial coefficients in lattice dimer models and upper bounds on the number of matchings on graphs
- Using edge generating function to solve monomer-dimer problem
- Title not available (Why is that?)
- Matchings in vertex-transitive bipartite 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
- Theory of computation of multidimensional entropy with an application to the monomer-dimer problem
- Computation of terms in the asymptotic expansion of dimer \(\lambda_d\) for high dimension
This page was built for publication: An asymptotic expansion and recursive inequalities for the monomer-dimer problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q540587)
