The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
G.F. Voronoi (1868–1908) wrote two memoirs in which he describes two reduction theories for lattices, well-suited for sphere packing and covering problems. In his first memoir a characterization of locally most economic packings is given, but a corresponding result for coverings has been missing. In this paper we bridge the two classical memoirs.
By looking at the covering problem from a different perspective, we discover the missing analogue. Instead of trying to find lattices giving...
We derive new upper bounds for the densities of measurable sets in which avoid a finite set of prescribed distances. The new bounds come from the solution of a linear programming
problem. We apply this method to obtain new upper bounds for measurable sets which avoid the unit distance in dimensions . This gives new lower bounds for the measurable chromatic
number in dimensions . We apply it to get a short proof of a variant of a recent result of Bukh which in turn generalizes theorems of Furstenberg,...
Download Results (CSV)