Derives explicit sandwich bounds on topological entropy h: (log C_{n+1} - q_d(n) log |Σ|)/n^d ≤ h ≤ log C_n / n^d for counts C_n of admissible patterns on n-cubes.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.DS 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Explicit entropy bounds for symmetric nearest-neighbor subshifts
Derives explicit sandwich bounds on topological entropy h: (log C_{n+1} - q_d(n) log |Σ|)/n^d ≤ h ≤ log C_n / n^d for counts C_n of admissible patterns on n-cubes.