SearcharxivSearch

arXiv · math/0606162

A Generalization of the Prime Geodesic Theorem to Counting Conjugacy Classes of Free Subgroups

Abstract

The classical prime geodesic theorem (PGT) gives an asymptotic formula (as $x$ tends to infinity) for the number of closed geodesics with length at most $x$ on a hyperbolic manifold $M$. Closed geodesics correspond to conjugacy classes of $π_1(M)=Γ$ where $Γ$ is a lattice in $G=SO(n,1)$. The theorem can be rephrased in the following format. Let $X(\Z,Γ)$ be the space of representations of $\Z$ into $Γ$ modulo conjugation by $Γ$. $X(\Z,G)$ is defined similarly. Let $π: X(\Z,Γ)\to X(\Z,G)$ be the projection map. The PGT provides a volume form $vol$ on $X(\Z,G)$ such that for sequences of subsets $\{B_t\}$, $B_t \subset X(\Z,G)$ satisfying certain explicit hypotheses, $|π^{-1}(B_t)|$ is asymptotic to $vol(B_t)$. We prove a statement having a similar format in which $\Z$ is replaced by a free group of finite rank under the additional hypothesis that $n=2$ or 3.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Lewis Bowen. 2006-10-01. A Generalization of the Prime Geodesic Theorem to Counting Conjugacy Classes of Free Subgroups. https://arxiv.org/abs/math/0606162

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