The Algebraicity Problem for Hard-Core Entropy Constants on the Discrete Hypertori

Source abstract

We use tools and techniques from $p-$adic analysis and algebraic number theory to study the algebraicity of the hard square entropy constant and its high dimensional analogues. Specifically, We study arithmetic properties of $a_d(n)$, the number of independent sets in the $d$-dimensional discrete torus, and the associated entropy constants $κ_d=\lim_{n\to\infty}a_d(n)^{1/n^d}$. It is not known whether $κ_d$ is algebraic or transcendental for $d>1$. Using the fact that the sequence $a_d(p^k)$ converges $p-$adically for every prime $p$, we collection of criteria for the algebraicity of $κ_d$ and bound the number of possible values of prime powers $p^k$ for which $a_d(p^k)=κ_d^{p^{kd}}$.