The density of sets avoiding distance 1 in Euclidean space
Preprint
Abstract
We improve by an exponential factor the best known asymptotic upper bound for the density of sets avoiding 1 in Euclidean space. This result is obtained by a combination of an analytic bound that is an analogue of Lovasz theta number and of a combinatorial argument involving finite subgraphs of the unit distance graph. In turn, we straightforwardly obtain an asymptotic improvement for the measurable chromatic number of Euclidean space. We also tighten previous results for the dimensions between 4 and 24.Keywords
All Related Versions
This publication has 8 references indexed in Scilit:
- A Course in Abstract Harmonic Analysis2016
- Spectral bounds for the independence ratio and the chromatic number of an operatorIsrael Journal of Mathematics, 2014
- Lower Bounds for Measurable Chromatic NumbersGeometric and Functional Analysis, 2009
- New Code Upper Bounds From the Terwilliger Algebra and Semidefinite ProgrammingIEEE Transactions on Information Theory, 2005
- Intersection theorems with geometric consequencesCombinatorica, 1981
- Hahn Polynomials, Discrete Harmonics, andt-DesignsSIAM Journal on Applied Mathematics, 1978
- The realization of distances within sets in Euclidean spaceMathematika, 1972
- Handbook of Mathematical Functions With Formulas, Graphs and Mathematical Tables (National Bureau of Standards Applied Mathematics Series No. 55)Journal of Applied Mechanics, 1965