Validations of the Asymptotic Matching Conjectures

Abstract

In this paper we review the asymptotic matching conjectures for $r$-regular bipartite graphs, and their connections in estimating the monomer-dimer entropies in $d$-dimensional integer lattice and Bethe lattices. We prove new rigorous upper and lower bounds for the monomer-dimer entropies, which support these conjectures. We describe a general construction of infinite families of $r$-regular tori graphs and give algorithms for computing the monomer-dimer entropy of density $p$, for any $p\in [0,1]$, for these graphs. Finally we use tori graphs to test the asymptotic matching conjectures for certain infinite $r$-regular bipartite graphs.

25 pages, 9 figures

References in corpus (1)

• Generalized Friedland-Tverberg inequality: applications and extensions

Cited by in corpus (7)

• Higher order expansions for the entropy of a dimer or a monomer-dimer system on d-dimensional lattices
• An Asymptotic Expansion and Recursive Inequalities for the Monomer-Dimer Problem
• Computation of Terms in the Asymptotic Expansion of Dimer lambda_d for High Dimension
• Analogs of the van der Waerden and Tverberg conjectures for haffnians
• Asymptotic Behavior of the Expectation Value of Permanent Products
• Asymptotic Behavior of the Expectation Value of Permanent Products, a Sequel
• Errata and Addenda to Mathematical Constants