2000 character limit reached
Lattice packings through division algebras
Published 10 Jul 2021 in math.NT and math.MG | (2107.04844v3)
Abstract: In this article, we will show the existence of lattice packings in a sparse family of dimensions. This construction will be a generalisation of Venkatesh's lattice packing result. In our construction, we replace the appearance of the cyclotomic number field with a division algebra over the rational field. For this, we develop an analogue of Siegel's mean value theorem over lattices that have a prescribed set of symmetries given by a finite non-commutative group inside the multiplicative subgroup of a division algebra. This approach improves the best known lattice packing bounds in many dimensions.
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.