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

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

2008-08-13

arxiv.org/abs/0808.1822v2

J. Eur. Math. Soc. 12 (2010), 1417-1428

Mathematics

Combinatorics

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

Scientific paper

10.4171/JEMS/236

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.

Affiliated with

Also associated with

No associations

Rating

Fourier analysis, linear programming, and densities of distance avoiding sets in R^n does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Fourier analysis, linear programming, and densities of distance avoiding sets in R^n, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Fourier analysis, linear programming, and densities of distance avoiding sets in R^n will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-386846