Long shortest vectors in low dimensional lattices
Number Theory
2020-08-27 v2
Abstract
For coprime integers , with , we define the set We study which parameters generate point sets with long shortest distances between the points of the set in dependence of and relate such sets to lattices of a particular form. As a main result, we present an infinite family of such lattices with the property that the normalised norm of the shortest vector of each lattice converges to the square root of the Hermite constant . We obtain a similar result for the generalisation of our construction to and dimensions.
Keywords
Cite
@article{arxiv.2006.00461,
title = {Long shortest vectors in low dimensional lattices},
author = {Florian Pausinger},
journal= {arXiv preprint arXiv:2006.00461},
year = {2020}
}
Comments
12 pages, 4 Figures. Generalisation to dimensions 4 and 5 added