Towards Strong Reverse Minkowski-type Inequalities for Lattices

FOCS, pp. 447-456, 2016.

Cited by: 11|Bibtex|Views25|Links
EI

Abstract:

We present a natural reverse Minkowski-type inequality for lattices, which gives upper bounds on the number of lattice points in a Euclidean ball in terms of sublattice determinants, and conjecture its optimal form. The conjecture exhibits a surprising wealth of connections to various areas in mathematics and computer science, including a...More

Code:

Data:

Your rating :
0

 

Tags
Comments