Lattice packings through division algebras
A lattice is a discrete closed subset \(\Lambda\) of a real vector space \(V\) with finite dimension with the property that \(V/\Lambda\) has finite volume. A lattice packing is a collection of balls of a given radius centered at the lattice points with the property that distinct balls are disjoint. The author gives a construction of lattice packings in a family of dimensions using division algebras generalizing a previously known construction. This generalization uses probabilistic methods to find these packings in certain dimensions with good packing densities improving known lower bounds in some cases and uses a division algebra variant of Siegel's mean value theorem.
- Lattice packing from quaternion algebras
- A Note on Lattice Packings via Lattice Refinements
- Lattices of optimal finite lattice packings
- Packing problems, dimensions and the tensor product of complete lattices
- On linear sections of lattice packings
- On sequences of lattice packings
- Mordell-Weil Lattices and Sphere Packings
- Lattice packing and covering of convex bodies
- scientific article; zbMATH DE number 67323
- An enlarged family of packing polynomials on multidimensional lattices
- A mean value theorem in geometry of numbers
- A note on sphere packings in high dimension
- Arithmetic subgroups of algebraic groups
- Finite Subgroups of Division Rings
- Finite-Dimensional Division Algebras over Fields
- scientific article; zbMATH DE number 179210 (Why is no real title available?)
- Improved sphere packing lower bounds from Hurwitz lattices
- Lie groups beyond an introduction
- On the geometry of numbers
- Optimality and uniqueness of the Leech lattice among lattices
- Über die Dichte der Primzahlen \(p\), für die eine vorgegebene ganzrationale Zahl \(a\neq 0\) von gerader bzw. ungerader Ordnung \(\mod p\) ist
This page was built for publication: Lattice packings through division algebras
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2106543)