The transience conjecture for uniform shifts on regular trees

Let Td\mathbb{T}_{d} be the homogeneous dd-ary tree with d3d\geq 3, and let a{\mathbf a} be an LL-periodic rotor sequence. The regular-tree uniform-shift transience conjecture. The rotor walk in the corresponding uniform shift model is transient almost surely for every a{\mathbf a}. The preceding lemma proves this assertion for the relevant class of sequences, but the stated conjecture for arbitrary periodic rotor sequences remains open.

Sources & referencesView supporting material

Primary source

Sebastian Mueller and Tal Orenshtein, “Infinite excursions of rotor walks on regular trees”, arXiv:1511.05896 (2017).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.