SearcharxivSearch

arXiv · 1302.3766

Ergodic currents dual to a real tree

Abstract

Let $T$ be an $\R$-tree in the boundary of Outer space with dense orbits. When the free group $\FN$ acts freely on $T$, we prove that the number of projective classes of ergodic currents dual to $T$ is bounded above by $3N-5$. We combine Rips induction and splitting induction to define unfolding induction for such an $\R$-tree $T$. Given a current $\mu$ dual to $T$, the unfolding induction produces a sequence of approximations converging towards $\mu$. We also give a unique ergodicity criterion.

Explore related subjects

Keep this discovery

BibTeXRIS

Thierry Coulbois, Arnaud Hilion. 2013-02-15. Ergodic currents dual to a real tree. https://doi.org/10.1017/etds.2014.78

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