Minkowski bases, Korkin-Zolotarev bases and successive minima
Abstract
Let λk denote the k-th successive minimum of a lattice L. We study properties of the lengths of certain bases of L. If v1, … vn is a basis which is reduced in the sense of Minkowski we show that vk 2 ≤ k4 λk2 for k = 6, 7, confirming a conjecture of Sch\"urmann, and obtaining the first improvement of a classical bound by Van der Waerden. We construct a sequences of lattices where vn is significantly longer than the longest vector in a Korkin-Zolotarev reduced basis, answering a question of Sch\"urmann. In an appendix joint with Lior Hadassi we construct a lattice L with the surprising property that any basis containing the shortest vector of L is not the shortest basis.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.