Lower escape-rate conjecture for the Hanoi towers group
Statement
Let be the Hanoi towers group, equipped with a finite generating set, and let be a simple symmetric random walk on . Here denotes the word length. Hanoi towers escape-rate conjecture. The group admits a simple symmetric random walk such that
The conjecture is motivated by the identification of the relevant Schreier graph with the infinite Sierpiński graph and by the walk dimension of Brownian motion on the Sierpiński gasket. It predicts a nontrivial lower bound on the expected displacement of a random walk on the Hanoi towers group.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.