Skip to content
DraconiticResearch
Search Sources API
186,541 studies31 sourcesUpdated 42 min ago
PreprintarXiv licencearXiv

Thermal Recurrence Orders of the Potts Model Partition Function in Grid Graphs

Abstract

We study the linear recurrence order of the Potts model partition function on thermal 2D grid graphs. By restricting the transfer matrix (TM) to the real coupling axis, the physical operator maintains diagonalizability under the Spectral Theorem. We show that this thermal regularization allows the Krylov subspace to saturate the unconstrained planar state capacity, locking the recurrence order to the Dyck path up to reversal (OEIS A007123) for q ≥ 4. Furthermore, the recurrence order collapses to height-restricted Dyck paths up to reversal (OEIS A001998) for q=3 due to finite-index Jones-Wenzl projections, and to the zero-magnetization conservation sector (OEIS A001405) for q=2. This framework bridges graph-theoretic combinatorics with the representation theory of physical loop gas models.

Versions

Related

  1. Higher-Order Fluctuations of the Log-Partition Function for Ising Models on Inhomogeneous Random Graphs
    Sanchayan Bhowal, Somabha Mukherjee
    arXivPreprintarXiv licenceFull textProbabilityarXiv
  2. A linear bound for a connectivity partition in graphs
    Jia Zhou, Jin Yan, Yunshu Gao
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  3. A study on Type-2 isomorphic circulant graphs. Part 5: Type-2 isomorphic circulant graphs of orders 48, 81, 96
    Vilfred Kamalappan
    arXivPreprintCC BY-NC-SA 4.0Full textCombinatorics & discrete mathematicsarXiv
  4. On short averages of the Fibonacci partition function
    Sam Chow, Owen Jones
    arXivPreprintCC BY 4.0Full textAlgebra & number theoryarXiv
  5. Double-Partition Coloring problem: a unified approach for conflict-free coloring of hypergraphs and other coloring problems in graphs
    Mauro Lucci, Graciela Nasini, Paola Tolomei +1
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsarXiv
BibTeX
@misc{wang2026thermal,
  title = {{Thermal Recurrence Orders of the Potts Model Partition Function in Grid Graphs}},
  author = {Yi-Zhong Wang},
  howpublished = {arXiv},
  year = {2026},
  month = aug,
  doi = {10.48550/arxiv.2608.21789},
  eprint = {2608.21789},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2608.21789},
}
RIS
TY  - UNPB
TI  - Thermal Recurrence Orders of the Potts Model Partition Function in Grid Graphs
AU  - Yi-Zhong Wang
PY  - 2026
DA  - 2026/08/22
PB  - arXiv
DO  - 10.48550/arxiv.2608.21789
UR  - https://arxiv.org/abs/2608.21789
AB  - We study the linear recurrence order of the Potts model partition function on thermal 2D grid graphs. By restricting the transfer matrix (TM) to the real coupling axis, the physical operator maintains diagonalizability under the Spectral Theorem. We show that this thermal regularization allows the Krylov subspace to saturate the unconstrained planar state capacity, locking the recurrence order to the Dyck path up to reversal (OEIS A007123) for q ≥ 4. Furthermore, the recurrence order collapses to height-restricted Dyck paths up to reversal (OEIS A001998) for q=3 due to finite-index Jones-Wenzl projections, and to the zero-magnetization conservation sector (OEIS A001405) for q=2. This framework bridges graph-theoretic combinatorics with the representation theory of physical loop gas models.
ER  -