SearcharxivSearch

arXiv · 1602.02971

Thompson's group $F$ is not Liouville

Abstract

We prove that random walks on Thompson's group $F$ driven by strictly non-degenerate finitely supported probability measures $\mu$ have a non-trivial Poisson boundary. The proof consists in an explicit construction of two different non-trivial $\mu$-boundaries. Both of them are defined in terms of the Schreier graph $\Gamma$ on the dyadic-rational orbit of the canonical action of $F$ on the unit interval (actually, we consider a natural embedding of $F$ into the group $PLF({\mathbb R})$ of piecewise linear homeomorphisms of the real line, and realize $\Gamma$ on the dyadic-rational orbit in ${\mathbb R}$). However, the behaviours at infinity described by these $\mu$-boundaries are quite different (in perfect keeping with the ambivalence concerning amenability of the group $F$). The first $\mu$-boundary is similar to the boundaries of the lamplighter groups: it consists of ${\mathbb Z}$-valued configurations on $\Gamma$ arising from the stabilization of the logarithmic increments of slopes along the sample paths of the random walk. The second $\mu$-boundary is more similar to the boundaries of groups with hyperbolic properties as it consists of the sections of the end bundle of the graph $\Gamma$: these are the collections of the limit ends of the induced random walk on $\Gamma$ parameterized by all possible starting points.

Explore related subjects

Keep this discovery

BibTeXRIS

Vadim A. Kaimanovich. 2016-02-09. Thompson's group $F$ is not Liouville. https://arxiv.org/abs/1602.02971

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