SearcharxivSearch

arXiv · 1211.3647

Diophantine property in the group of affine transformations of the line

Abstract

We investigate the Diophantine property of a pair of elements in the group of affine transformations of the line. We say that a pair of elements g_1,g_2 in this group is Diophantine if there is a number A such that a product of length l of elements of the set {g_1,g_2,g_1^{-1},g_2^{-1}} is either the unit element or of distance at least A^{-l} from the unit element. We prove that the set of non-Diophantine pairs in a certain one parameter family is of Hausdorff dimension 0.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Péter Pál Varjú. 2013-07-12. Diophantine property in the group of affine transformations of the line. https://doi.org/10.14232/actasm-013-757-6

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