Entropy-minimal subshift characterization of uniform dimension in arithmetic progressions
Entropy-minimal subshift characterization of uniform dimension in arithmetic progressions
Let be an integer, let be -invariant, meaning invariant under multiplication by , and let denote Minkowski dimension. An entropy minimal subshift is a subshift whose every proper subshift has strictly smaller topological entropy.
Entropy-minimal subshift conjecture. There exists an entropy minimal subshift representing if and only if, for every arithmetic progression ,
This conjecture proposes a characterization of the sets arising from entropy minimal symbolic systems through their intersections with arithmetic progressions. The paper establishes the analogous assertion for transitive sofic subshifts and gives broader affirmative results, but the stated equivalence is presented as a conjecture.
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Sources & referencesView supporting material
Primary source
Vicente Saavedra-Araya, “Distribution of integers with digit restrictions via Markov chains”, arXiv:2411.07418 (2025).
Additional references
4 papers in this index state this conjecture (2018–2024). The statement above is taken from the most recent of them; the others are arXiv:2201.11179, arXiv:2104.13317, arXiv:1803.09718.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.