Papers
Topics
Authors
Recent
Search
2000 character limit reached

Minkowski bases, Korkin-Zolotarev bases and successive minima

Published 6 Jun 2021 in math.MG, math.CO, and math.NT | (2106.03183v2)

Abstract: Let $\lambda_k$ denote the $k$-th successive minimum of a lattice $L$. We study properties of the lengths of certain bases of $L$. If $v_1, \dots v_n$ is a basis which is reduced in the sense of Minkowski we show that $\lvert v_k \rvert2 \leq \frac{k}{4} \lambda_{k}2$ 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 $\lvert v_n \rvert$ 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.

Authors (1)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.