SearcharxivSearch

arXiv · 1906.03578

Ping-pong partitions and locally discrete groups of real-analytic circle diffeomorphisms, I: Construction

Abstract

Following the recent advances in the study of groups of circle diffeomorphisms, we describe an efficient way of classifying the topological dynamics of locally discrete, finitely generated, virtually free subgroups of the group $\mathsf{Diff}^\omega_+(\mathbb S^1)$ of orientation preserving real-analytic circle diffeomorphisms, which include all subgroups of $\mathsf{Diff}^\omega_+(\mathbb S^1)$ acting with an invariant Cantor set. An important tool that we develop, of independent interest, is the extension of classical ping-pong lemma to actions of fundamental groups of graphs of groups. Our main motivation is an old conjecture by P. R. Dippolito [Ann. Math. 107 (1978), 403--453] from foliation theory, which we solve in this restricted but significant setting: this and other consequences of the classification will be treated in more detail in a companion work.

Explore related subjects

Keep this discovery

BibTeXRIS

Juan Alonso, Sébastien Alvarez, Dominique Malicet, Carlos Meniño Cotón, Michele Triestino. 2019-06-09. Ping-pong partitions and locally discrete groups of real-analytic circle diffeomorphisms, I: Construction. https://arxiv.org/abs/1906.03578

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