ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let H\mathcal{H} be the Hanoi towers group, equipped with a finite generating set, and let XnX_n be a simple symmetric random walk on H\mathcal{H}. Here ∣Xn∣H|X_n|_{\mathcal{H}} denotes the word length. Hanoi towers escape-rate conjecture. The group H\mathcal{H} admits a simple symmetric random walk such that

nlog⁡2log⁡5⪯E∣Xn∣H.n^{\frac{\log 2}{\log 5}}\preceq \mathbb{E}|X_n|_{\mathcal{H}}.

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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.