SearcharxivSearch

arXiv · math/0312066

Dynamical forcing of circular groups

Abstract

In this paper we introduce and study the notion of dynamical forcing. Basically, we develop a toolkit of techniques to produce finitely presented groups which can only act on the circle with certain prescribed dynamical properties. As an application, we show that the set X of rotation numbers which can be forced by finitely presented groups is an infinitely generated Q-module, containing countably infinitely many algebraically independent transcendental numbers. We also show that the set of subsets of the circle which are the set of rotation numbers of an element g of a group G under all actions of G on a circle, as G varies over all countable groups, are exactly the set of closed subsets of the circle which contain 0, and are invariant under the involution which interchanges x and -x. As another application, we construct a finitely generated group which acts faithfully on the circle, but which does not admit any faithful C^1 action, thus answering in the negative a question of John Franks.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Danny Calegari. 2004-09-09. Dynamical forcing of circular groups. https://arxiv.org/abs/math/0312066

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