SearcharxivSearch

arXiv · 2206.11111

Poisson boundary of group extensions

Abstract

Given a finitely generated group, the well-known Stability Problem asks whether the non-triviality of the Poisson-Furstenberg boundary (which is equivalent to the existence of non-constant bounded harmonic functions) depends on the choice of simple random walk on the group. This question was far from being understood even in the class of linear groups. Given an amenable group, e.g. a solvable group, there is no known characterisation, even a conjectural one, of when it admits a simple random walk with non-trivial boundary. We provide a characterisation of groups with non-trivial boundary for finitely generated linear groups of characteristic $p$. We prove in particular that the Stability Problem has a positive answer in this class of groups. For linear groups of characteristic $0$, we prove a sufficient condition for the triviality of the boundary which does not depend on the choice of a simple random walk. We conjecture that our sufficient condition is also necessary. Our arguments are based on a new comparison criterion for group extensions, on new $\Delta$-restriction entropy estimates and a criterion for boundary non-triviality, and on a new "cautiousness" criterion for triviality of the boundary.

Explore related subjects

Keep this discovery

BibTeXRIS

Anna Erschler, Joshua Frisch. 2022-06-22. Poisson boundary of group extensions. https://arxiv.org/abs/2206.11111

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Reversibility and its asymptotic counting in Picard group

We investigate reversible elements in the Picard modular group $\mathrm{PSL}(2,\mathbb{Z}[i])$. We show that reversibility coincides with strong reversibility for Kleinian groups, in particular for the Picard group. We classify reversible elements in the Picard group and characterize loxodromic reversible elements up to conjugacy. We prove that each such conjugacy class contains exactly eight special representatives. We also obtain asymptotic estimates for the number of reversible conjugacy classes with bounded trace.

math.GR

Conjugator length in finitely generated groups

We describe all functions $\mathbb{N}\rightarrow \mathbb{N}$ that can be realized, up to the standard equivalence, as conjugator length functions of finitely generated groups. Furthermore, we show that any two increasing functions $f,g\colon \mathbb N\to \mathbb N$ can be simultaneously realized as conjugator length functions of finitely generated, commensurable (in particular, quasi-isometric) groups.

math.GR

The spectrum of conjugator length functions

A recent program tries to find which functions appear as conjugator length functions. In this note, we show that any (computable) increasing function larger than $n$ appears as $\mathrm{Cl}_G$ for some finitely generated (recursively presented) group. On the other hand, we demonstrate that either $\mathrm{Cl}_G$ must be constant or $\mathrm{Cl}_G(n)\succ n$. Combining these, we obtain a complete description of which functions appear as conjugator length functions of finitely generated groups.

math.GR