Classification of recurrent groups for finite-alphabet group-extended Markov systems

Let (Σ×G,σΨ)\left(\Sigma\times G,\sigma\rtimes\Psi\right) be an irreducible group-extended Markov system with finite alphabet II, and let φ:ΣR\varphi:\Sigma\rightarrow\mathbb{R} be a Hölder-continuous potential. If φπ1\varphi\circ\pi_{1} is recurrent, then GG is a recurrent group. Recurrent-group classification conjecture. The stated implication should hold under these hypotheses. The result is presented as following from an investigation of graph automorphisms and a theorem of Woess; its resolution is not specified in the supplied text.

Sources & referencesView supporting material

Primary source

Johannes Jaerisch, “Recurrence and pressure for group extensions”, arXiv:1205.4490 (2013).

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.