New bounds on the density of lattice coverings

05/30/2020
by   Or Ordentlich, et al.
0

We obtain new upper bounds on the minimal density of lattice coverings of Euclidean space by dilates of a convex body K. We also obtain bounds on the probability (with respect to the natural Haar-Siegel measure on the space of lattices) that a randomly chosen lattice L satisfies that L+K is all of space. As a step in the proof, we utilize and strengthen results on the discrete Kakeya problem.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/20/2019

Improved Upper Bounds on the Hermite and KZ Constants

The Korkine-Zolotareff (KZ) reduction is a widely used lattice reduction...
research
06/24/2020

Lattice Representation Learning

In this article we introduce theory and algorithms for learning discrete...
research
09/05/2019

Sticky matroids and convolution

Motivated by the characterization of the lattice of cyclic flats of a ma...
research
09/10/2019

Relativistic changes to particle trajectories are difficult to detect

We study the sensitivity of the computed orbits for the Kepler problem, ...
research
01/09/2018

The DMT classification of real and quaternionic lattice codes

In this paper we consider space-time codes where the code-words are rest...
research
01/29/2018

Communication-Efficient Search for an Approximate Closest Lattice Point

We consider the problem of finding the closest lattice point to a vector...
research
04/26/2018

Application of Lowner-John's Ellipsoid in the Steganography of Lattice Vectors and a Review of The Gentry's FHE

In this paper, first, we utilize the Lowner-John's ellipsoid of a convex...

Please sign up or login with your details

Forgot password? Click here to reset