An asymptotic expansion and recursive inequalities for the monomer-dimer problem
From MaRDI portal
(Redirected from Publication:540587)
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).
Recommendations
- Asymptotic expansions for \(\lambda _{d }\) of the dimer and monomer-dimer problems
- \(1/n\) expansion for the number of matchings on regular graphs and Monomer-Dimer entropy
- On the validations of the asymptotic matching conjectures
- Computation of terms in the asymptotic expansion of dimer \(\lambda_d\) for high dimension
- On the monomer-dimer problem of some graphs
Cites work
- scientific article; zbMATH DE number 3458807 (Why is no real title available?)
- scientific article; zbMATH DE number 3248840 (Why is no real title available?)
- A Lower Bound for the Monomer-Dimer Problem
- An asymptotic solution of the multidimensional dimer problem
- An improved upper bound for the \(3\)-dimensional dimer problem
- Asymptotic expansions for \(\lambda _{d }\) of the dimer and monomer-dimer problems
- 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
- 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 computation of multidimensional entropy with an application to the monomer-dimer problem
Cited in
(14)- Monomer-dimer problem on random planar honeycomb lattice
- A positivity property of the dimer entropy of graphs
- Asymptotic expansions for \(\lambda _{d }\) of the dimer and monomer-dimer problems
- Study of dimer-monomer on the generalized Hanoi graph
- Positivity of the virial coefficients in lattice dimer models and upper bounds on the number of matchings on graphs
- Monomer-dimer problem on some networks
- Matchings in vertex-transitive bipartite graphs
- Theory of computation of multidimensional entropy with an application to the monomer-dimer problem
- Matching measure, Benjamini-Schramm convergence and the monomer-dimer free energy
- Computation of terms in the asymptotic expansion of dimer \(\lambda_d\) for high dimension
- Dimer model: full asymptotic expansion of the partition function
- scientific article; zbMATH DE number 2170418 (Why is no real title available?)
- \(1/n\) expansion for the number of matchings on regular graphs and Monomer-Dimer entropy
- Using edge generating function to solve monomer-dimer problem
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)
