Entropy maximality conjecture for periodic regular graphs
Let and satisfy the assumptions of the theorem preceding this statement, and let and denote their monomer–dimer entropies at density . Entropy maximality conjecture. For every ,
The statement is presented as a consequence of the preceding theorem and the transfer-matrix comparison; however, the theorem's assumptions and the definitions of , , and are not included in the supplied context. Its status therefore cannot be determined from this span.
References
- Shmuel Friedland, Elliot Krop, Per Hakan Lundow and Klas Markström, “Validations of the Asymptotic Matching Conjectures”, arXiv:math/0603001 (2008).
Progress summary
Never refreshed
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.