On sublattice determinants in reduced bases

Simple item page
dc.creatorPataki, Gabor
dc.creatorTural, Mustafa
dc.date2008-04-24
dc.date2008-05-08
dc.date.accessioned2026-07-07T09:37:29Z
dc.date.available2026-07-07T09:37:29Z
dc.descriptionWe 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.
dc.description5 pages
dc.identifierhttps://arxiv.org/abs/0804.4014
dc.identifierhttp://arxiv.org/abs/0804.4014
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/160476
dc.subjectNumber Theory
dc.subjectCombinatorics
dc.subjectMetric Geometry
dc.subjectOptimization and Control
dc.subject11H06, 11H50, 11Y16
dc.titleOn sublattice determinants in reduced bases
dc.typetext

Files

Collections

arXiv