Related papers: Minkowski bases, Korkin-Zolotarev bases and succes…
In this paper, we show that for each lattice basis, there exists an equivalent basis which we describe as ``strongly reduced''. We show that bases reduced in this manner exhibit rather ``short'' basis vectors, that is, the length of the…
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…
Finding the shortest vectors in a lattice is an NP-hard problem, so low-dimensional results also play an essential role in lattice reduction theory. Using Ryskov's result for the admissible centerings and Tammela's result for determining…
Given a lattice $\Lambda \subset \mathbb{R}^n$, we consider its Minkowski reduced basis and the solid angle $\Omega$ spanned by the basis vectors. Such a basis satisfies strong near-orthogonality conditions, which allow us to bound from…
The Hermite-Korkine-Zolotarev reduction plays a central role in strong lattice reduction algorithms. By building upon a technique introduced by Ajtai, we show the existence of Hermite-Korkine-Zolotarev reduced bases that are arguably least…
The main purpose of this note is to prove an upper bound on the number of lattice points of a centrally symmetric convex body in terms of the successive minima of the body. This bound improves on former bounds and narrows the gap towards a…
Lattices defined as modules over algebraic rings or orders have garnered interest recently, particularly in the fields of cryptography and coding theory. Whilst there exist many attempts to generalise the conditions for LLL reduction to…
We adapt an argument of Tao and Vu to show that if $\lambda_1\le\cdots\le\lambda_d$ are the successive minima of an origin-symmetric convex body $K$ with respect to some lattice $\Lambda<\mathbb{R}^d$, and if we set…
Given an arbitrary basis for a mathematical lattice, to find a ``good" basis for it is one of the classic and important algorithmic problems. In this note, we give a new and simpler proof of a theorem by Regavim (arXiv:2106.03183): we…
In the study of Euclidean lattices, the product of the successive minima is bounded from above and below by explicit quantities. This result is known as Minkowski's second theorem, and can be refined to include Hermite's constant in the…
$ \newcommand{\R}{\mathbb{R}} \newcommand{\lat}{\mathcal{L}} $We prove a conjecture due to Dadush, showing that if $\lat \subset \R^n$ is a lattice such that $\det(\lat') \ge 1$ for all sublattices $\lat' \subseteq \lat$, then \[ \sum_{\vec…
Minkowski's second theorem on successive minima asserts that the volume of a 0-symmetric convex body K over the covolume of a lattice \Lambda can be bounded above by a quantity involving all the successive minima of K with respect to…
We compare for an $n$-dimensional Euclidean lattice $\Lb$ the smallest possible values of the product of the norms of $n$~vectors which either constitute a basis for $\Lb$ (Hermite-type inequalities) or are merely assumed to be independent…
There exist two issues among popular lattice reduction (LR) algorithms that should cause our concern. The first one is Korkine-Zolotarev (KZ) and Lenstra-Lenstra-Lovasz (LLL) algorithms may increase the lengths of basis vectors. The other…
We show that the number of lattice directions in which a d-dimensional convex body in R^d has minimum width is at most 3^d-1, with equality only for the regular cross-polytope. This is deduced from a sharpened version of the 3^d-theorem due…
The Korkine-Zolotareff (KZ) reduction is one of the often used reduction strategies for lattice decoding. In this paper, we first investigate some important properties of KZ reduced matrices. Specifically, we present a linear upper bound on…
We study the problem of best approximations of a vector $\alpha\in{\mathbb R}^n$ by rational vectors of a lattice $\Lambda\subset {\mathbb R}^n$ whose common denominator is bounded. To this end we introduce successive minima for a periodic…
Minkowski proved that any $n$-dimensional lattice of unit determinant has a nonzero vector of Euclidean norm at most $\sqrt{n}$; in fact, there are $2^{\Omega(n)}$ such lattice vectors. Lattices whose minimum distances come close to…
This paper deals with lattices $(L,\Vert~\Vert)$ over polynomial rings, where $L$ is a finitely generated module over $k[t]$, the polynomial ring over the field $k$ in the indeterminate $t$, and $\Vert~\Vert$ is a discrete real-valued…
The Korkine-Zolotareff (KZ) reduction is a widely used lattice reduction strategy in communications and cryptography. The Hermite constant, which is a vital constant of lattice, has many applications, such as bounding the length of the…