A local Yang-Baxter obstruction for the hard-square model
Listen
Radio episode about this paper
Transcript
Introduction to the show: ident: Mathematical Physics. The day in mathematical physics: rigorous models of physical systems.
Kai: We're looking at the paper: "A local Yang-Baxter obstruction for the hard-square model".
Mira: Here's the gist of the paper. Many exact solutions of two-dimensional lattice models rest on an analytic family of weights satisfying the Yang–Baxter equation The hard-square model has no known closed form, but this paper determines that there is a local Yang–Baxter obstruction for it Classification of Encoding Alphabets A connected height alphabet that encodes hard squares without hidden heights is isomorphic either to the binary alphabet or to the alphabet A4 of Andrews, Baxter and Forrester with occupied heights The binary alphabet itself is such an encoding, and so is the hard-hexagon alphabet A4 above This classification is presented in Theorem A (Classification; Proposition 2.5).
Kai: Obstruction to Yang–Baxter Families Theorem B states that there is no family (Wuv) of face weights on the binary alphabet or A4, depending analytically on spectral parameters u, v in a connected domain, such that some Wp0r0 is a presentation of hard squares of nonzero activity.
Mira: This obstruction arises because when the middle face is a hard-square face, the exclusion rule forces auxiliary weights to vanish algebraically The mechanism involves algebraic and local proof where a short combination of seven of them yields an explicit polynomial certificate forcing the product of three auxiliary weights to vanish.
Kai: Sharpness and Extensions Theorem B is sharp on both alphabets, since with the same occupation map each of them carries a Yang–Baxter family through hard hexagons Adding diagonal interactions changes the model and restores integrability, as hard hexagons on A4 and Baxter’s diagonal-interaction surface are specializations of Yang–Baxter families The obstruction is specific to the pure hard-core rule.
Title and authors: Kai: We're starting with "A local Yang-Baxter obstruction for the hard-square model," and the main point is that there isn't just one way to get an analytic solution for hard squares without hidden heights; there are only two possible structures we can see.
Mira: They first classify the height alphabets, finding only two connected ones that can encode hard squares without hidden heights: you have the binary alphabet of occupation variables and this specific four-height alphabet from Andrews, Baxter and Forrester.
The paper's summary: Kai: To summarize the findings in "A local Yang-Baxter obstruction for the hard-square model," they're showing that there isn't just one way to get an analytic solution for hard squares without hidden heights; there are only two possible structures we can see.
Mira: They’ve proven that while hard hexagons work fine on both of those setups, the hard squares don't fit into that simple analytic family because of how the exclusion rule behaves differently when you look at the middle face <ref:2611.06780#pg3>.
Lev: The real mechanism they point to is this obstruction when a hard square face sits right in the middle of those weights, it forces some auxiliary weights to become zero algebraically which basically breaks the analytic family idea completely.
Kai: It’s like they found a very specific algebraic shortcut, a short combination of seven or eight faces on that four-height alphabet that generates an explicit polynomial certificate forcing three auxiliary weights to vanish <ref:2611.06780#pg3>. That's the core of why we can't find these simple analytic solutions for the hard square model.
Mira: But they also showed this obstruction isn't as bad as it seems because they made it sharp, meaning it still holds even if you change how you map those weights around with another occupation map, and when you add diagonal interactions to the model, things become integrable again because those hard hexagons on the four-height alphabet are actually special cases of Yang-Baxter families <ref:2611.06780#pg3>.
Lev: For us building real hardware, if we try to stick to a pure hard square rule, we're going to hit this wall because the underlying structure itself just doesn't support that analytic family <ref:2611.06780#pg3>. We can’t rely on that kind of method for those specific models.
Kai: They also looked into other kinds of encodings, not just height alphabets, like blocks of two sites or the binary alphabet where one equals one <ref:2611.06780#pg3>. For these blocked models, they found a structural limitation through theorem four-one that says no analytic family passes through a blocked hard square face if those four specific weights A, B, C and D are not zero <ref:2611.06780#pg3>.
Mira: That's a very clear geometric constraint for those blocked systems; it means if you have those four specific weights non-zero on the blocked square face, you simply can't have an analytic family passing through it <ref:2611.06780#pg3>. It’s a hard boundary.
Lev: That boundary is important because it tells us exactly where to look for solvable physics in these types of models, which points directly towards those diagonal interaction cases we mentioned before <ref:2611.06780#pg3>.
The paper's improvements: Kai: So, to summarize the improvements suggested by this paper on that hard square model obstruction, they've confirmed that this rule holds even if you change how you map those weights around with the same occupation map <ref:2611.06780#pg3>. That’s a nice piece of structural confirmation for the result.
Mira: They also looked at things outside of height alphabets, specifically to encodings that don't fit the original definition <ref:2611.06780#pg2>. This includes blocks of two sites and that binary alphabet where one equals one <ref:2611.06780#pg3>.
Lev: For those blocked models, they found a structural limitation through theorem four-one that says no analytic Yang-Baxter family passes through a blocked hard square face if the four specific weights A, B, C and D are not zero <ref:2611.06780#pg3>.
Kai: That's a clear structural limitation for blocked systems; if you have those four specific weights non-zero on the blocked square face, you simply can't have an analytic family passing through it <ref:2611.06780#pg3>. It sounds like they’ve nailed down the geometric constraint imposed by the hard-core rule in this context.
Mira: And they also touched on the possibility of hidden heights, which is a remaining open question <ref:2611.06780#pg1>. They ask if there could be an analytic Yang-Baxter family for a height alphabet with hidden heights whose shadow is the hard square model with nonzero activity <ref:2611.06780#pg3>.
Lev: That's where the real difficulty lies, because hidden heights imply that the number of height configurations over a hard square configuration is unbounded or depends on that specific configuration <ref:2611.06780#pg1>. So they’re asking if we can even find a solution there, which is a big question for the future.
Kai: They also gave us some concrete finite computations that verify these results on both the binary alphabet and the four-height alphabet <ref:2611.06780#pg3>. That gives us confidence in this algebraic proof, even though it's highly technical.
Mira: So, to summarize these improvements, it’s a rigorous way of saying that the pure hard-core rule just isn't integrable through analytic families of weights <ref:2611.06780#pg3>. It sets a very clear boundary for what we expect from these types of models.
Lev: That boundary is important because it tells us exactly where to look for solvable physics in this domain, which points towards those diagonal interaction cases mentioned earlier <ref:2611.06780#pg3>.
Conclusion: Kai: So we’ve been looking at this paper "A local Yang–Baxter obstruction for the hard-square model." Essentially, they’re showing that there isn't a simple analytic family of weights that works for hard squares without hidden heights.
Mira: Right, they've classified the height alphabets first—only the binary alphabet or this A four alphabet from Andrews, Baxter and Forrester can encode them without hidden heights.
Lev: And then they prove there is this specific obstruction when you put a hard-square face in the middle of that family. It forces auxiliary weights to vanish algebraically, which kills the whole analytic idea.
Kai: That algebraic proof involves finding a short combination of seven or eight faces on the A four alphabet that creates a polynomial certificate forcing three auxiliary weights to zero.
Mira: And they showed this obstruction is sharp, meaning it holds even if you change the occupation map with another one, and they even showed that adding diagonal interactions restores integrability for those special cases where hard hexagons on A four are involved.
Kai: It also touches on blocked models, where they prove that for face weights on F, no analytic family passes through a blocked hard-square face if A, B, C and D aren't zero.
Kai: So in summary, the paper "A local Yang–Baxter obstruction for the hard-square model" confirms that pure hard-square rules don't have these simple analytic families.
Lev: It’s a useful piece of information because it tells us exactly where to look for solvable physics in this domain, which points towards those diagonal interaction cases we talked about earlier.
GABRIEL ORTEGA, ELIECER PENA-ANCAVIL
Centro de Investigación Avanzada en Educación (CIAE) · Instituto de Estudios Avanzados en Educación (IE) · Universidad de Chile · Diagnostika Labs · Universidad Bernardo O’Higgins
math-ph, cond-mat.stat-mech, math.MP, nlin.SI
Submitted: 2026-11-04
Updated: 2026-11-04
Comments: 24 pages, 2 figures. Ancillary script anc/verify_certificates.py, also at https://github.com/gabrielortegaproyectos/hard-square-yang-baxter-obstruction (doi:10.5281/zenodo.23892182)
License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Importance score: 83/100
The gist: Many exact solutions of two-dimensional lattice models rest on an analytic family of weights satisfying the Yang–Baxter equation The hard-square model has no known closed form…
Key concepts
- Yang–Baxter equation
- This is a fundamental mathematical condition that describes the integrability of certain two-dimensional lattice models. If weights satisfy this equation, it implies the existence of an infinite number of conserved quantities, allowing for exact solutions to the model.
- Height Alphabet
- This refers to a specific way of encoding configurations on a lattice using heights. The paper classifies these alphabets and shows that only two types—the binary alphabet or the A4 alphabet—can encode hard squares without hidden heights.
- Local Yang–Baxter Obstruction
- This is a mathematical barrier demonstrating that an analytic family of weights satisfying the Yang–Baxter equation cannot exist for the hard-square model. This obstruction arises because when a middle face is a hard-square, algebraic constraints force auxiliary weights to vanish, preventing the existence of such families.
Terminology
Summary
Many exact solutions of two-dimensional lattice models rest on an analytic family of weights satisfying the Yang–Baxter equation The hard-square model has no known closed form, but this paper determines that there is a local Yang–Baxter obstruction for it
Classification of Encoding Alphabets
A connected height alphabet that encodes hard squares without hidden heights is isomorphic either to the binary alphabet or to the alphabet A4 of Andrews, Baxter and Forrester with occupied heights The binary alphabet itself is such an encoding, and so is the hard-hexagon alphabet A4 above This classification is presented in Theorem A (Classification; Proposition 2.5).
Obstruction to Yang–Baxter Families
Theorem B states that there is no family (Wuv) of face weights on the binary alphabet or A4, depending analytically on spectral parameters u, v in a connected domain, such that some Wp0r0 is a presentation of hard squares of nonzero activity. This obstruction arises because when the middle face is a hard-square face, the exclusion rule forces auxiliary weights to vanish algebraically The mechanism involves algebraic and local proof where a short combination of seven of them yields an explicit polynomial certificate forcing the product of three auxiliary weights to vanish. p. 2
Sharpness and Extensions
Theorem B is sharp on both alphabets, since with the same occupation map each of them carries a Yang–Baxter family through hard hexagons Adding diagonal interactions changes the model and restores integrability, as hard hexagons on A4 and Baxter’s diagonal-interaction surface are specializations of Yang–Baxter families The obstruction is specific to the pure hard-core rule.
Beyond Height Alphabets
The mechanism of Section 3 applies to encodings that are not height alphabets in the sense of Definition 2.3, namely to blocks of two sites and to the binary alphabet with 1 ∼ 1 Corollary 4. p. 32 states that no analytic Yang–Baxter family of blocked face weights on F passes through a blocked hard-square face with A, B, C, D not being zero. p. 2
Hidden Heights and Open Questions
The remaining possibility within height alphabets is an encoding with hidden heights, in which the number of height configurations over a hard-square configuration is unbounded or depends on the configuration Question 5. p. 11 asks if there is an analytic Yang–Baxter family of face weights on a height alphabet with hidden heights whose shadow is the hard-square model with nonzero activity. p. 0 p. 0
Finite Computations
Appendix A lists finite computations that are reproduced by the ancillary script anc/verify certificates.py These computations verify the certificates for both the binary alphabet and the alphabet A4. p. 3 The results confirm that no analytic Yang–Baxter family passes through a presentation of hard squares with nonzero activity. p. 0 p. 0
References
[1] G. E. Andrews, R. p. 0 J. Baxter, and P. p. 0 J. Forrester, Eight-vertex SOS model and generalized Rogers–Ramanujan-type identities, J. p. 0 Stat. Phys 35 (1984), 193–266
[2] M. Assis, J. L. Jacobsen, I. Jensen, J.-M. Maillard, and B. M. McCoy, Integrability versus nonintegrability: hard hexagons and hard squares compared, J Phys A 47 (2014), 445001; arXiv:1406. p. 35566
[3] R. J. Baxter, Partition function of the eight-vertex lattice model, Ann Phys 70 (1972), 193–228
[4] R. J. Baxter, Hard hexagons: exact solution, J Phys A 13 (1980), L61–L70
[5] R. J. Baxter, Rogers–Ramanujan identities in the hard hexagon model, J Stat Phys 26 (1981), 427–452
[6] R. J. Baxter, Exactly Solved Models in Statistical Mechanics, Academic Press London, 1982
[7] R. J. Baxter, Planar lattice gases with nearest-neighbor exclusion, Ann Comb 3 (1999), 191–203
[8] R. J. Baxter, Hard squares for z = −1, Ann Comb 15 (2011), 185–195; arXiv:0709. p. 04324
[9] R. J. Baxter, I. G. Enting, and S. K. Tsang, Hard-square lattice gas, J Stat Phys 22 (1980), 465–489
[10] R. J. Baxter and P. p. 0 A. Pearce, Hard squares with diagonal attractions, J Phys A 16 (1983), 2239–2255
[11] Y.-B. Chan, Series expansions from the corner transfer matrix renormalization group method: the hard-squares model, J Phys A 45 (2012), 085001; arXiv:1107. p. 11677
[12] N. Chandgotia and B. Marcus, Mixing properties for hom-shifts and the distance between walks on associated graphs, Pacific J Math 294 (2018), 41–69; arXiv:1607. p. 008357
[13] E. Date, M. Jimbo, A. Kuniba, T. Miwa, and M. Okado, Exactly solvable SOS models: local height probabilities and theta function identities, Nuclear Phys B 290 (1987), 231–273
[14] P. Fendley, K. Schoutens, and H. van Eerten, Hard squares with negative activity, J Phys A 38 (2005), 315–322; arXiv:cond-mat/0408497
[15] P. Fendley, K. Sengupta, and S. Sachdev, Competing density-wave orders in a one-dimensional hard-boson model, Phys Rev B 69 (2004), 075106; arXiv:cond-mat/0309438
[16] D. S. Gaunt and M. E. Fisher, Hard-sphere lattice gases. p. 0 I. Plane-square lattice, J Chem Phys 43 (1965), 2840–2863
[17] D. A. Huse, Tricriticality of interacting hard squares: some exact results, Phys Rev Lett 49 (1982), 1121–1124
[18] V. F. R. Jones, Baxterization, Internat J Modern Phys B 4 (1990), 701–73
[19] J. Jonsson, Hard squares with negative activity and rhombus tilings of the plane, Electron J Combin 13 (2006), R67
[20] P. W. Kasteleyn, The statistics of dimers on a lattice. p. 0 I. The number of dimer arrangements on a quadratic lattice, Physica 27 (1961), 1209–1225
[21] S. Nyckees and F. Mila, Tensor network investigation of the hard-square model, Phys Rev B 106 (2022), 174433; arXiv:2205. p. 002508
[23] V. Pasquier, Etiology of IRF models, Comm Math Phys 118 (1988), 355–364
[24] P. A. Pearce, Hard hexagons, hard squares and hard mathematics, J Phys A 49 (2016), 411003
[25] L. K. Runnels and L. L. Combs, Exact finite method of lattice statistics. p. 0 I. Square and triangular lattice gases of hard molecules, J Chem Phys 45 (1966), 2482–2492
[26] M. Sanatani, N. Shiraishi, and F. Ishii, A simple necessary and sufficient condition for Yang–Baxter integrability, preprint (2026), arXiv:2607. p. 029660
[27] N. Shiraishi, Proof of the absence of local conserved quantities in the XYZ chain with a magnetic field, EPL 128 (2019), 17002; arXiv:1803. p. 302637
[28] S. Tanaka, R. Tamura, and H. Katsura, Entanglement spectra of the quantum hard-square model: holographic minimal models, Phys Rev A 86 (2012), 032326; arXiv:1207. p. 06752
[30] S. O. Warnaar and B. Nienhuis, Solvable lattice models labelled by Dynkin diagrams, J Phys A 26 (1993), 2301–2316; arXiv:hep-th/9301026
[31] S. O. Warnaar, B. Nienhuis, and K. A. Seaton, New construction of solvable lattice models including an Ising model in a field, Phys Rev Lett 69 (1992), 710–712
[32] Y.-K. Zhou and P. A. Pearce, Fusion of A-D-E lattice models, Internat J Modern Phys B 8 (1994), 3531–3577
Blocks and the Binary Alphabet with 1 ∼ 1
The mechanism of Section 3 applies to encodings that are not height alphabets in the sense of Definition 2.3, namely to blocks of two sites and to the binary alphabet with 1 ∼ 1 on which the hard-core rule is carried by vanishing weights Blocked face weights are functions on F, and (2. p. 31) is read with g running over the three blocks. p. 5
Exclusion by Vanishing Weights
On the binary alphabet with 1 ∼ 1 every face is admissible, so the hard-core rule can be imposed only by the weights Proposition 4.3 states that no analytic Yang–Baxter family on this alphabet passes through Qb. p. 0
Question 5.2 asks whether there are analytic families of blocked faces Wuv on F and Suv on FV such that every triple (Wpq, Wpr, Sqr) satisfies (2. p. 12) and some Wp0r0 is the blocked hard-square face. p. 2 Question 5.1 asks if there is an analytic Yang–Baxter family of face weights on a height alphabet with hidden heights whose shadow is the hard-square model with nonzero activity.
Appendix A
The finite statements listed below are reproduced by the ancillary script anc/verify certificates.py The appendix lists finite computations for both the binary alphabet and the alphabet A4. p. 3 The results confirm that no analytic Yang–Baxter family passes through a presentation of hard squares with nonzero activity.
Green — the paper says it, and the page is printed. Red — no passage carries it, so treat that sentence as unverified. The same check runs on your own text: check a summary against its source, $5.
Improvements for AI systems
-
Improved ability to classify height alphabets for hard squares by recognizing that
A connected reduced height alphabet with at least two heights is reduced
implies a structure isomorphic to eitherthe binary alphabet or A4.
-
Enhanced capability to determine the exact set of analytic Yang-Baxter families on height alphabets, specifically by using the algebraic certificates like
(3.17) rho0 A0A1 D0 r(0)5 p(0)2 r(0)3 = rho r(0)6 G1 + A0r(0) 0 G2 − r(0)5 G3 − D0r(5) G4 − A0D0r(5) G5
to rule out non-integrable families. -
Increased precision in identifying obstructions for the hard-square model by distinguishing between the obstruction to analytic families passing through a presentation and the obstruction to any analytic family passing through a presentation, as summarized in Corollary 3.5:
No reduced height alphabet that encodes hard squares without hidden heights carries an analytic Yang-Baxter family passing through a presentation of hard squares with nonzero activity.
-
Improved analysis of blocked models by identifying the structural limitations imposed by Theorem 4.1:
(4.2) BC P [L 0 0] R [L L 0 0] = 0,
which provesNo analytic Yang-Baxter family of blocked face weights on F passes through a blocked hard-square face with A, B, C, D not equal to zero.
-
Development of a system capable of distinguishing between the obstruction to analytic families and the possibility that
a transfer matrix that commutes with a family without belonging to it
might be possible when consideringencodings with hidden heights.
Sources
- Integrability vs non-integrability: Hard hexagons and hard squares compared
- Hard Squares for z = -1
- Series expansions from the corner transfer matrix renormalization group method: the hard squares model
- Mixing Properties for Hom-Shifts and the Distance between Walks on Associated Graphs
- Hard squares with negative activity
- Competing density-wave orders in a one-dimensional hard-boson model
- Tensor network investigation of the hard-square model
- Graph theoretical proof of nonintegrability in quantum many-body systems : Application to the PXP model
- A Simple Necessary and Sufficient Condition for Yang--Baxter Integrability
- Proof of the absence of local conserved quantities in the XYZ chain with a magnetic field
- Entanglement Spectra of the quantum hard-square model: Holographic minimal models
- Solvable lattice models labelled by Dynkin diagrams
Related papers
- Existence of a fluid phase for the two-dimensional one-component plasma
- The Huang-Yang conjecture for the low-density Fermi gas
- Anderson localisation in infinite and finite resonator crystals with long-range interactions
- Free energy and spectral edge of the SYK model
- Anderson localization for 1-d quasi-periodic Schr"odinger operators with degenerate weights
- Irregular SLE(4) martingales and isomonodromic deformations