pith. sign in

arxiv: 0804.4014 · v3 · submitted 2008-04-24 · 🧮 math.NT · math.CO· math.MG· math.OC

On sublattice determinants in reduced bases

classification 🧮 math.NT math.COmath.MGmath.OC
keywords determinantsbasesinequalitieslenstraprovesublatticesvectorbounds
0
0 comments X
read the original abstract

We prove several inequalities on the determinants of sublattices in LLL-reduced bases. They generalize the inequalities on the length of the shortest vector proven by Lenstra, Lenstra, and Lovasz, and show that LLL-reduction finds not only a short vector, but more generally, sublattices with small determinants. We also prove new upper bounds on the product of the norms of the first few vectors.

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.