Algebraicity of higher-dimensional hard-core entropy constants

Determine whether the entropy constant \(\kappa_d\), defined as the limiting exponential growth rate of independent sets in the \(d\)-dimensional discrete torus, is algebraic or transcendental for every dimension \(d>1\).

Background

For the dd-dimensional discrete torus Td(n)T_d(n), the quantity ad(n)a_d(n) counts independent sets and κd=limnad(n)1/nd\kappa_d=\lim_{n\to\infty}a_d(n)^{1/n^d} is the associated hard-core entropy constant. The one-dimensional value κ1=(1+5)/2\kappa_1=(1+\sqrt5)/2 is algebraic because it is the Perron eigenvalue of a fixed finite transfer matrix.

For dimensions greater than one, the relevant transfer matrices grow with the transverse system size, so the one-dimensional algebraicity mechanism does not apply. The paper develops arithmetic, pp-adic, and approximation-theoretic obstructions, but explicitly does not determine the arithmetic nature of κd\kappa_d for d2d\ge2.

References

It is not known whether $\kappa_d$ is algebraic or transcendental for $d>1.

The Algebraicity Problem for Hard-Core Entropy Constants on the Discrete Hypertori  (2608.28332 - Svoray, 28 Aug 2026) in Abstract; Section 1, Introduction