2000 character limit reached
An Asymptotic Expansion and Recursive Inequalities for the Monomer-Dimer Problem
Published 30 Nov 2010 in math-ph, cond-mat.stat-mech, math.CO, and math.MP | (1011.6579v3)
Abstract: Let (lambda_d)(p) be the p monomer-dimer entropy on the d-dimensional integer lattice Zd, 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 Zd 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).
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.