The bounded-support zero-entropy conjecture for polynomial automaton groups
The bounded-support zero-entropy conjecture for polynomial automaton groups
Let be a polynomial automaton group of degree at most , and let a random walk on have a step distribution with bounded support. The bounded-support zero-entropy conjecture. Every such random walk has zero asymptotic entropy. This conjecture is open even for degree . It concerns whether the symmetry and support assumptions used in the paper are artifacts of the proof, and extends the zero-entropy phenomenon beyond the specially constructed mother-group walks.
Sources & referencesView supporting material
Primary source
Gideon Amir, Omer Angel and Balint Virag, “Amenability of linear-activity automaton groups”, arXiv:0905.2007 (2011).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.