Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1107.3666

Sieve methods in group theory I: Powers in Linear groups

Alexander Lubotzky·Chen Meiri
View original source ↗Read source document ↗Export metadata ↓

Abstract

A general sieve method for groups is formulated. It enables one to "measure" subsets of a finitely generated group. As an application we show that if $Γ$ is a finitely generated non virtually-solvable linear group of characteristic zero then the set of proper powers in $Γ$ is exponentially small. This is a far reaching strengthening of the main result of \cite{HKLS}.

Explore related subjects

math.GR

Keep this discovery

BibTeXRIS

Alexander Lubotzky, Chen Meiri. 2011-07-19. Sieve methods in group theory I: Powers in Linear groups. https://arxiv.org/abs/1107.3666

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

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↗
arXiv2026

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↗
arXiv2026

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↗