Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2608.21789

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

Yi-Zhong Wang
View original source ↗Read source document ↗Export metadata ↓

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 \ge 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.

Explore related subjects

cs.DMmath-phmath.MP

Keep this discovery

BibTeXRIS

Yi-Zhong Wang. 2026-08-22. Thermal Recurrence Orders of the Potts Model Partition Function in Grid Graphs. https://doi.org/10.1016/j.physa.2026.131963

Cite the original work for its findings. Save a collection to share your selection of sources.

Discover connections

cs.DM subjectmath-ph subjectmath.MP subject

Connections use source metadata and explicit phrase matches, not verified experimental comparisons.

KEEP EXPLORING

Related papers

arXiv2026

Geometric integrators for adiabatically closed simple thermodynamic systems

A variational formulation for non-equilibrium thermodynamics was developed by Gay-Balmaz and Yoshimura. In a recent article, the first two authors of the present paper introduced partially cosymplectic structures as a geometric framework for thermodynamic systems, recovering the evolution equations obtained variationally. In this paper, we develop a discrete variational principle for adiabatically closed simple thermodynamic systems, which can be utilised to construct numerical integrators for the dynamics of such systems. The effectiveness of our method is illustrated with several examples.

math-ph↗
arXiv2026

Why Multi-Layer Message Passing Works: Completeness Theory for Graph Neural Network Interatomic Potentials

We prove that the Hypergraph Neural Network, an invariant architecture with 3-body message passing, is a universal approximator for potential energy surfaces. Our main contribution is a multi-layer completeness theory. We show that $L$ layers of message passing on sparse, cutoff-based graphs achieve the same representational power as having access to the full $L$-hop neighborhood, provided the configurations are generic, satisfy an overlap condition and a connectivity condition. This provides the first rigorous justification for the common practice of using multi-layer message passing with a per-layer cutoff smaller than the physical interaction range, the setting used by virtually all practical graph neural network based machine-learned interatomic potentials. As immediate consequences, we show that both DPA3 and CHGNet architectures inherit universal approximation.

cs.LG↗
arXiv2026

Difference equations of average entropies

Exact cumulants of entanglement entropies of random state ensembles have traditionally been studied within the random matrix framework. In this work, we propose an alternative approach based on the intrinsic connection to integrable systems. The central idea is to embed entropic quantities into tau functions satisfying Toda-type lattice equations, which in turn yield linear difference equations for their averages. Directly solving the difference equations recovers exact entropy formulas in the literature. The integrable systems approach bypasses the case-by-case, ensemble-dependent derivations required by random matrix methods. The approach also suggests a possible route towards unified and more efficient higher-order cumulant calculations by exploring integrable hierarchies.

math-ph↗