Validations of the Asymptotic Matching Conjectures

dc.creatorFriedland, Shmuel
dc.creatorKrop, Elliot
dc.creatorLundow, Per Hakan
dc.creatorMarkström, Klas
dc.date2006-02-28
dc.date2008-04-11
dc.date.accessioned2026-07-07T09:31:38Z
dc.date.available2026-07-07T09:31:38Z
dc.descriptionIn 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.
dc.description25 pages, 9 figures
dc.identifierhttps://arxiv.org/abs/math/0603001
dc.identifierhttp://arxiv.org/abs/math/0603001
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/158527
dc.subjectCombinatorics
dc.subjectMathematical Physics
dc.subject05A15, 05A16, 05C70, 05C80, 82B20
dc.titleValidations of the Asymptotic Matching Conjectures
dc.typetext

Files

Collections