2000 character limit reached
Lattices of minimal covolume in SL_n(R)
Published 26 May 2017 in math.GR, math.NT, and math.RT | (1705.09742v2)
Abstract: The objective of this paper is to determine the lattices of minimal covolume in SL_n(R), for n greater than 3. The answer turns out to be the simplest one: SL_n(Z) is, up to automorphism, the unique lattice of minimal covolume in SL_n(R). In particular, lattices of minimal covolume in SL_n(R) are non-uniform when n is greater than 3, contrasting with Siegel's result for SL_2(R). This answers for SL_n(R) the question of Lubotzky: is a lattice of minimal covolume typically uniform or not?
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.