Classification of recurrent groups for finite-alphabet group-extended Markov systems
Classification of recurrent groups for finite-alphabet group-extended Markov systems
Let be an irreducible group-extended Markov system with finite alphabet , and let be a Hölder-continuous potential. If is recurrent, then 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
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.