Buzzi’s question on generating forbidden words and measures of maximal entropy
Let be a subshift over a finite alphabet, and let be a collection of generating forbidden words for . If the entropy is strictly smaller than the topological entropy , must have only finitely many ergodic measures of maximal entropy, with each such measure Bernoulli up to a finite period, and must admit a characteristic measure of maximal entropy? In particular, the question may be restricted to the case in which is the collection of minimal forbidden words.
References
- Generating Forbidden Words and Measures of Maximal Entropy for Subshifts — arXiv — Xinxing Wu, Xu Zhang
Source: arXiv
Progress summary
A recent preprint claims that Buzzi’s question has a negative answer, while broader classification of maximal-entropy measures remains open.
Buzzi’s question asks whether generating forbidden words forces finiteness and the expected statistical structure of maximal-entropy measures. No earlier classical results specific to this question were identified in the retrieved record.
November 2026 preprint
Xinxing Wu and Xu Zhang claim a general entropy criterion yielding finiteness, Bernoulli structure, and a characteristic maximal-entropy measure, and use it to answer Buzzi’s question negatively. The claim is not independently verified in the retrieved record; the result applies only under a strict entropy inequality and does not classify arbitrary subshifts.
Current status (as of November 2026): Wu and Zhang claim a negative resolution of Buzzi’s question, but the broader problem remains open and the claimed resolution is unverified.
Sources
Solutions 0
No solutions have been posted yet.