Fourier analysis, linear programming, and densities of distance avoiding sets in R^n

Abstract

In this paper we derive new upper bounds for the densities of measurable sets in R^n 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 2,..., 24. This gives new lower bounds for the measurable chromatic number in dimensions 3,..., 24. We apply it to get a new, short proof of a variant of a recent result of Bukh which in turn generalizes theorems of Furstenberg, Katznelson, Weiss and Bourgain and Falconer about sets avoiding many distances.

11 pages, 1 figure (v2) some modifications and corrections, accepted in Journal of the European Mathematical Society

Cited by in corpus (12)

• Invariant semidefinite programs
• Spectral bounds for the independence ratio and the chromatic number of an operator
• Complete positivity and distance-avoiding sets
• Better bounds for planar sets avoiding unit distances
• An improvement on the Delsarte-type LP-bound with application to MUBs
• Bloch sphere colourings and Bell inequalities
• A quantitative version of Steinhaus' theorem for compact, connected, rank-one symmetric spaces
• Density estimates of 1-avoiding sets via higher order correlations
• The density of planar sets avoiding unit distances
• Lower bounds for the measurable chromatic number of the hyperbolic plane
• A recursive Lovász theta number for simplex-avoiding sets
• Sets avoiding integral distances