Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1001.1720

The limit set of subgroups of arithmetic groups in $PSL(2,C)^q \times PSL(2,R)^r$

Slavyana Geninska
View original source ↗Read source document ↗Export metadata ↓

Abstract

While lattices in semi-simple Lie groups are studied very well, only little is known about discrete subgroups of infinite covolume. The main class of examples are Schottky groups. Here we investigate some new examples. We consider subgroups $Γ$ of arithmetic groups in $PSL(2,C)^q \times PSL(2,R)^r$ with $q+r>1$ and their limit set. We prove that the projective limit set of a nonelementary finitely generated $Γ$ consists of exactly one point if and only if one and hence all projections of $Γ$ to the simple factors of $PSL(2,C)^q \times PSL(2,R)^r$ are subgroups of arithmetic Fuchsian or Kleinian groups. Furthermore, we study the topology of the whole limit set of $Γ$. In particular, we give a necessary and sufficient condition for the limit set to be homeomorphic to a circle.

Explore related subjects

math.GRmath.GT

Keep this discovery

BibTeXRIS

Slavyana Geninska. 2010-01-11. The limit set of subgroups of arithmetic groups in $PSL(2,C)^q \times PSL(2,R)^r$. https://arxiv.org/abs/1001.1720

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↗