On Minkowksi's bound for lattice-packings
classification
🧮 math.NT
math.MG
keywords
bounddenselatticesproofalmostconstructingeffectiveelementary
read the original abstract
We give a new proof of the Minkowski-Hlawka bound on the existence of dense lattices. The proof is based on an elementary method for constructing dense lattices which is almost effective.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.