The critical-fugacity asymptotic conjecture for the hard-core model on the lattice

From papers

Let uhc u^{\text{hc}} denote the hard-core model on Zd\mathbb{Z}^{d}, and let λc+(d)\lambda_{c}^{+}(d) be its upper critical fugacity. The dimension is dd.

Critical-fugacity asymptotic conjecture.

λc+(d)e2das d.\lambda_{c}^{+}(d)\sim\frac{e}{2d}\quad\text{as }d\to\infty.

This conjecture asserts that the lower bound supplied by the tree threshold gives the correct leading asymptotics for the onset of multiple Gibbs measures on Zd\mathbb{Z}^{d}. The paper's theorem gives multiple Gibbs measures for λ>Clogdd\lambda>C\frac{\log d}{d}, leaving the sharper asymptotic open.

Progress summary

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Sources & referencesView supporting material

Primary source

Daniel Hadas and Ron Peled, “On the critical fugacity of the hard-core model on regular bipartite graphs”, arXiv:2603.27144 (2026).

Solutions 0

No solutions have been posted yet.