Search arXivSearch

arXiv · 1501.06443

Lower bounds for covolumes of arithmetic lattices in $PSL_2(\mathbb R)^n$

Abstract

We study the covolumes of arithmetic lattices in $PSL_2(\mathbb R)^n$ for $n\geq 2$ and identify uniform and non-uniform irreducible lattices of minimal covolume. More precisely, let $μ$ be the Euler-Poincaré measure on $PSL_2(\mathbb R)^n$ and $χ=μ/2^n$. We show that the Hilbert modular group $PSL_2(\mathfrak o_{k_{49}})\subset PSL_2(\mathbb R)^3$, with $k_{49}$ the totally real cubic field of discriminant $49$ has the minimal covolume with respect to $χ$ among all irreducible lattices in $PSL_2(\mathbb R)^n$ for $n\geq 2$ and is unique such lattice up to conjugation. The uniform lattice of minimal covolume with respect to $χ$ is the normalizer $Δ_{k_{725}}^u$ of the norm-1 group of a maximal order in the quaternion algebra over the unique totally real quartic field with discriminant $725$ ramified exactly at two infinite places, which is a lattice in $PSL_2(\mathbb R)^2$. There is exactly one more lattice in $PSL_2(\mathbb R)^2$ and exactly one in $PSL_2(\mathbb R)^4$ with the same covolume as $Δ_{k_{725}}^u$, which are the Hilbert modular groups corresponding to $\mathbb Q(\sqrt{5})$ and $k_{725}$. The two lattices $Δ_{k_{725}}^u$ and $PSL_2(\mathfrak o_{\mathbb Q(\sqrt{5})})$ have the smallest covolume with respect to the Euler-Poincaré measure among all arithmetic lattices in $G_n$ for all $n\geq 2$. These results are in analogy with Siegel's theorem on the unique minimal covolume (uniform and non-uniform) Fuchsian groups and its generalizations to various higher dimensional hyperbolic spaces due to Belolipetsky, Belolipetsky-Emery, Stover and Emery-Stover.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Amir Džambić. 2015-01-26. Lower bounds for covolumes of arithmetic lattices in $PSL_2(\mathbb R)^n$. https://arxiv.org/abs/1501.06443

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

KEEP EXPLORING

Related papers

Word Length Formulae, Normal Forms, Conjugation and Root-finding Algorithms in Surface Groups

In this paper, we mainly study the following symmetric presentation of the surface group $$π_1(Σ_g)=\left\langle c_1,\dots, c_{2g}\mid c_1\cdots c_{2g}c_1^{-1}\cdots c_{2g}^{-1}\right\rangle.$$ For every nontrivial element $x\in π_1(Σ_g)$ and $k\geq 2$, we obtain a uniform representative of the normal forms $\mathfrak{nf}(x^k)$ of $x^k$ under the length-lexicographical order: $$\mathfrak{nf}(x^k) = \overline{LW^{k-2}R}.$$ Building on this result, we establish a new relation among these normal forms, and then derive the following three formulae related to the word length: $|x^2|>|x|$; $|x^k|=(k-1)(|x^2|-|x|)+|x|$; $\lim_{k\to\infty}\frac{|x^k|}{k}=|x^2|-|x|$. Furthermore, we extend these results to obtain a coarser analogue for every minimal geometric presentation. We then define normal forms of conjugacy classes in $π_1(Σ_g)$ and provide a criterion for determining the conjugacy of group elements. As a consequence, we provide efficient algorithms for solving the root-finding and conjugacy problems. Finally, we present applications to the computation of several growth rates.

math.GT

Plane separating continua inscribe rectangles

We prove the following: If $X$ is a plane separating continuum, then every embedding of $X$ into $\mathbb{R}^2$ contains the vertices of a Euclidean rectangle. We arrive to this result by extending a known result by H. Vaughan for Jordan curves to a wider class of topological objects via shape theory and Steenrod homology.

math.GT

Every Link Has Infinitely Many Explicit Generalised T-Link Presentations

Generalised $T$-links provide a simple description of all links in $S^3$ as closures of products of standard twisting blocks, parametrised by finite sequences of integers. We prove that every link admits infinitely many pairwise distinct generalised $T$-link presentations. Starting from any such presentation, we give explicit parameter transformations that preserve the represented link and generate families of pairwise distinct presentations depending on arbitrarily many independent integer parameters.

math.GT