A positivity property of the dimer entropy of graphs

DOI10.1016/j.physa.2014.11.033zbMath1395.05089arXiv1409.4549OpenAlexW2070796591MaRDI QIDQ1783324

Mario Pernici, Paul Federbush, Paolo Butera

Publication date: 20 September 2018

Published in: Physica A (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1409.4549

zbMATH Keywords

graph entropydimer problem

Mathematics Subject Classification ID

Paths and cycles (05C38) Random walks, random surfaces, lattice animals, etc. in equilibrium statistical mechanics (82B41)

Related Items (6)

Positivity of the virial coefficients in lattice dimer models and upper bounds on the number of matchings on graphs ⋮ \(1/n\) expansion for the number of matchings on regular graphs and Monomer-Dimer entropy ⋮ Matching measure, Benjamini-Schramm convergence and the monomer-dimer free energy ⋮ Statistical Matching Theory ⋮ Matchings in vertex-transitive bipartite graphs ⋮ A positivity property of the dimer entropy of graphs

Uses Software

• SageMath

Cites Work

• Unnamed Item
• An asymptotic expansion and recursive inequalities for the monomer-dimer problem
• On the number of matchings in regular graphs
• On the validations of the asymptotic matching conjectures
• The Holens-Đoković conjecture on permanents fails!
• Problems in algebraic combinatorics
• A positivity property of the dimer entropy of graphs
• Lower matching conjecture, and a new proof of Schrijver's and Gurvits's theorems

This page was built for publication: A positivity property of the dimer entropy of graphs