SearcharxivSearch

arXiv · 1604.03613

Comparison of Volumes of Siegel Sets and Fundamental Domains of $\mathrm{SL}_n(\mathbb{Z})$

Abstract

The purpose of this paper is to calculate explicitly the volumes of Siegel sets which are coarse fundamental domains for the action of $\mathrm{SL}_n (\mathbb{Z})$ in $\mathrm{SL}_n (\mathbb{R})$, so that we can compare these volumes with those of the fundamental domains of $\mathrm{SL}_n (\mathbb{Z})$ in $\mathrm{SL}_n (\mathbb{R})$, which are also computed here, for any $n\geq 2$. An important feature of this computation is that it requires keeping track of normalization constants of the Haar measures. We conclude that the ratio between volumes of fundamental domains and volumes of Siegel sets grows super-exponentially fast as $n$ goes to infinity. As a corollary, we obtained that this ratio gives a super-exponencial lower bound, depending only on $ n $, for the number of intersecting Siegel sets. We were also able to give an upper bound for this number, by applying some results on the heights of intersecting elements in $ \mathrm{SL}_n (\mathbb{Z}) $.

Explore related subjects

Keep this discovery

BibTeXRIS

Gisele Teixeira Paula. 2016-04-12. Comparison of Volumes of Siegel Sets and Fundamental Domains of $\mathrm{SL}_n(\mathbb{Z})$. https://doi.org/10.1007/s10711-018-0350-5

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