The hard-core model (the nearest-neighbor hard-square lattice gas) on the square lattice places probability on independent sets weighted by an activity per occupied site. Series analyses going back to Gaunt and Fisher (1965) and Baxter, Enting and Tsang (1980) suggest a single critical activity separating uniqueness of the infinite-volume Gibbs measure from phase coexistence of the two checkerboard-ordered phases, but neither the existence of such a sharp threshold nor its location has been proved. The source paper (Restrepo, Shin, Tetali, Vigoda and Yang, FOCS 2011) improved the rigorously provable uniqueness regime to using branching matrices and a finite decay criterion (the DMS condition), and explicitly posed the underlying open problems. Later work improved the lower bound to (Vera, Vigoda and Yang, 2015) and then (Sinclair, Srivastava, Štefankovič and Yin, 2017), while coexistence is proved only for (Blanca, Chen, Galvin, Randall and Tetali, 2019); moreover Vera, Vigoda and Yang proved that for every fixed per-vertex ordering the self-avoiding-walk-tree comparison fails beyond , so the branching-matrix form of this methodology underlying the earlier uniqueness bounds cannot reach the conjectured threshold. The open problem is to prove or disprove that the hard-core model on has a single critical activity separating uniqueness from coexistence, and to determine its value (in particular, prove or refute the conjecture ). The current rigorous envelope around the conjectured is unchanged since 2017-2018, and the problem remains open.
Background
The hard-core model is a lattice gas with hard exclusion constraints, one of the two or three most studied models of discrete statistical mechanics. On a finite graph its configurations are the independent sets (sets of vertices with no two adjacent, i.e. no two particles at neighboring sites), and receives weight , where the activity (fugacity) controls the density; the normalizing constant is the partition function . On the infinite square lattice one studies infinite-volume Gibbs measures, i.e. probability measures on configurations with the correct conditional probabilities in every finite region. The central question is whether the Gibbs measure is unique or whether there is phase coexistence (multiple Gibbs states, distinguished by far-away boundary conditions). For the hard-core model on the two competing extremal states at high activity are the two checkerboard configurations (full occupation of the even or of the odd sublattice, the maximum independent sets), so coexistence means the system spontaneously selects a parity class.
Series analyses of the hard-square model (Gaunt and Fisher 1965; Baxter, Enting and Tsang 1980; Rácz 1980) have long suggested that uniqueness and coexistence are separated by a single critical activity , with a continuous, Ising-like transition; unlike the Ising model or Baxter's exactly solved hard-hexagon model on the triangular lattice, the square-lattice model has no known exact solution. On the rigorous side, uniqueness is certified through decay of correlations: strong spatial mixing (SSM) means the influence of boundary conditions on the marginal probability of a vertex decays exponentially in the distance to the set where the boundary conditions differ, uniformly over boundary conditions and finite subgraphs; SSM implies uniqueness of the Gibbs measure and underlies deterministic fully polynomial-time approximation schemes (FPTAS) for the partition function and rapid mixing of the Glauber dynamics (the single-site update Markov chain) on finite subregions.
Weitz (STOC 2006) established the previous benchmark: the marginal at any vertex of any graph is exactly reproduced at the root of a tree of self-avoiding walks (SAW tree), an infinite tree encoding all self-avoiding walks from the vertex with cycle-closing leaves pinned by an ordering of the neighbors; comparing with the infinite regular tree , whose hard-core uniqueness threshold is classical, gives SSM on any graph of maximum degree for . For () this yields (earlier disagreement-percolation arguments, a coupling technique of van den Berg and Steif, and computer-assisted uniqueness-criterion arguments had given bounds only in the range 1.25-1.51). The source paper refined Weitz's comparison for : grouping self-avoiding walks by finitely many types that avoid short cycles, it bounds all SAW trees of the lattice by trees generated from a branching matrix (a nonnegative integer matrix whose entry bounds the number of children of type of a type- vertex), and certifies exponential decay of the message recursions via a finite system of inequalities in parameters and involving the suprema of explicit one-parameter functions (the DMS condition, Definition 7 of that paper). With 4, 17, 132 and 922 types this proves SSM for respectively; verifying the condition required heuristically guessed parameters (found by random-walk search) together with provable piecewise-linear envelope bounds for the .
Subsequent work shaped the problem as it stands today. Vera, Vigoda and Yang replaced the heuristic search by linear programming over piecewise-linear messages, reaching , and, crucially, proved a limitation: for every per-vertex ordering , SSM fails on the SAW tree as soon as (for homogeneous orderings, ), so the SAW-tree comparison methodology provably cannot certify uniqueness up to the conjectured (the cap is proven for fixed per-vertex orderings; the path-dependent relative orderings that Sinclair, Srivastava, Štefankovič and Yin use fall outside its formal statement, but their achieved bound remains far below ). Sinclair, Srivastava, Štefankovič and Yin introduced the connective constant (the exponential growth rate of the number of self-avoiding walks, rigorously bounded above by on ) as the effective degree, obtaining SSM for on graphs of connective constant at most , and a tailored analysis bounding the connective constant of a Weitz SAW tree by gives SSM on for , the best current lower bound. On the other side, a classical Peierls-type contour argument (the energy of the long domain wall forced between the two ordered phases dominates its entropy at large ) gives , and fault-line Peierls contours counted by oriented (taxi-walk) self-avoiding walks prove coexistence for all , with a proven barrier at about for that method. The model lacks monotonicity in (a counterexample on a non-regular tree is due to Brightwell, Häggström and Winkler), which blocks the sharpness machinery that pins exact critical points for percolation and the Ising model; Häggström constructed other periodic lattices with monotone hard-core transitions, but for the question is open.
Problem Statement
Determine the uniqueness phase transition of the hard-core model (nearest-neighbor hard-square lattice gas) on the square lattice , as posed in the source paper for , , with the flagship case: (1) Prove or disprove that there exists a single critical activity such that the infinite-volume Gibbs measure is unique for every and there are multiple Gibbs states (coexistence of the two checkerboard-ordered phases) for every ; in particular rule out, or establish, non-monotone behavior in which the uniqueness region is not an interval. (2) Determine the value of : prove or refute that it equals the empirically conjectured of the hard-square series analyses, by closing the current rigorous gap to within the precision of that series estimate — that is, by rigorous bounds that either locate at the conjectured value or else exclude it. These two facets serve one overarching objective, the determination of the phase diagram in the activity parameter, and a complete answer settles the existence, sharpness and location of the transition; improved bounds on either side are progress but not completion unless they locate the conjectured value of at the precision of that series estimate or else exclude it. The same questions remain open for with .
References
- Ricardo Restrepo, Jinwoo Shin, Prasad Tetali, Eric Vigoda, Linji Yang, 'Improved Mixing Condition on the Grid for Counting and Sampling Independent Sets', Proceedings of the 52nd IEEE Symposium on Foundations of Computer Science (FOCS 2011), pp. 140-149, arXiv:1105.0914, DOI 10.1109/FOCS.2011.45, https://arxiv.org/abs/1105.0914
- Dror Weitz, 'Counting independent sets up to the tree threshold', Proceedings of the 38th ACM Symposium on Theory of Computing (STOC 2006), pp. 140-149, DOI 10.1145/1132516.1132538, https://doi.org/10.1145/1132516.1132538
- David S. Gaunt, Michael E. Fisher, 'Hard-Sphere Lattice Gases. I. Plane-Square Lattice', The Journal of Chemical Physics 43 (1965) 2840-2863, DOI 10.1063/1.1697217, https://doi.org/10.1063/1.1697217
- R. J. Baxter, I. G. Enting, S. K. Tsang, 'Hard-square lattice gas', Journal of Statistical Physics 22 (1980) 465-489, DOI 10.1007/BF01012867, https://doi.org/10.1007/BF01012867
- Zoltán Rácz, 'Phase boundary of Ising antiferromagnets near H = Hc and T = 0: Results from hard-core lattice gas calculations', Physical Review B 21 (1980) 4012-4016, DOI 10.1103/PhysRevB.21.4012, https://doi.org/10.1103/PhysRevB.21.4012
- R. J. Baxter, 'Hard hexagons: exact solution', Journal of Physics A: Mathematical and General 13 (1980) L61-L70, DOI 10.1088/0305-4470/13/3/007, https://doi.org/10.1088/0305-4470/13/3/007
- Juan C. Vera, Eric Vigoda, Linji Yang, 'Improved Bounds on the Phase Transition for the Hard-Core Model in 2 Dimensions', SIAM Journal on Discrete Mathematics 29 (2015) 1895-1915, arXiv:1306.0431, DOI 10.1137/140976923, https://arxiv.org/abs/1306.0431
- Alistair Sinclair, Piyush Srivastava, Daniel Štefankovič, Yitong Yin, 'Spatial mixing and the connective constant: optimal bounds', Probability Theory and Related Fields 168 (2017) 153-197, arXiv:1410.2595, DOI 10.1007/s00440-016-0708-2, https://arxiv.org/abs/1410.2595
- Antonio Blanca, David Galvin, Dana Randall, Prasad Tetali, 'Phase Coexistence and Slow Mixing for the Hard-Core Model on Z^2', Proceedings of APPROX/RANDOM 2012, Lecture Notes in Computer Science 7408, Springer (2013), pp. 379-394, arXiv:1211.6182, DOI 10.1007/978-3-642-40328-6_27, https://arxiv.org/abs/1211.6182
- Antonio Blanca, Yuxuan Chen, David Galvin, Dana Randall, Prasad Tetali, 'Phase Coexistence for the Hard-Core Model on Z^2', Combinatorics, Probability and Computing 28 (1) (2019) 1-22, arXiv:1611.01115, DOI 10.1017/S0963548318000238, https://arxiv.org/abs/1611.01115
- Graham R. Brightwell, Olle Häggström, Peter Winkler, 'Nonmonotonic Behavior in Hard-Core and Widom-Rowlinson Models', Journal of Statistical Physics 94 (3) (1999) 415-435, DOI 10.1023/A:1004592103315, https://doi.org/10.1023/A:1004592103315
- Olle Häggström, 'A Monotonicity Result for Hard-Core and Widom-Rowlinson Models on Certain d-dimensional Lattices', Electronic Communications in Probability 7 (2002), DOI 10.1214/ecp.v7-1048, https://doi.org/10.1214/ecp.v7-1048
- Marcus Michelen, Will Perkins, 'Analyticity for classical gasses via recursion', Communications in Mathematical Physics 399 (1) (2023) 367-388, arXiv:2008.00972, DOI 10.1007/s00220-022-04559-8, https://arxiv.org/abs/2008.00972
- Marcus Michelen, Will Perkins, 'Potential-weighted connective constants and uniqueness of Gibbs measures', Communications in Mathematical Physics 406 (2) (2025), article 32, arXiv:2109.01094, DOI 10.1007/s00220-024-05214-0, https://arxiv.org/abs/2109.01094
- Yuan Chen, Shuai Shao, Ke Shi, 'Zero-Freeness of the Hard-Core Model with Bounded Connective Constant', arXiv:2604.02746 (2026), https://arxiv.org/abs/2604.02746
- Sarah Cannon, Tyler Helmuth, Will Perkins, 'Pirogov-Sinai Theory for the Hard-Core Model Beyond Lattices', Communications in Mathematical Physics 407 (6) (2026), article 129, DOI 10.1007/s00220-026-05623-3, https://doi.org/10.1007/s00220-026-05623-3
- Han Peters, Guus Regts, Josias Reppekus, 'Decay of correlations and zeros for the hard-core model', arXiv:2603.17858 (2026), https://arxiv.org/abs/2603.17858
- Charilaos Efthymiou, 'On sampling two spin models using the local connective constant', arXiv:2411.08179 (2024), https://arxiv.org/abs/2411.08179
- Geyang Wang, Alexander Barg, Navin Kashyap, 'The maximal hard-core model as a recoverable system: Gibbs measures and phase coexistence', arXiv:2510.19746 (2025), https://arxiv.org/abs/2510.19746
- Geyang Wang, Alexander Barg, Navin Kashyap, 'Recoverable systems and the maximal hard-core model on the triangular lattice', arXiv:2602.18310 (2026), https://arxiv.org/abs/2602.18310