Fourier analysis, linear programming, and densities of distance avoiding sets in \(\mathbb R^n\)
From MaRDI portal
Publication:604438
DOI10.4171/JEMS/236zbMath1205.90196arXiv0808.1822OpenAlexW3101514374MaRDI QIDQ604438
Fernando Mário de Oliveira Filho, Frank Vallentin
Publication date: 11 November 2010
Published in: Journal of the European Mathematical Society (JEMS) (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0808.1822
Related Items (22)
On the measurable chromatic number of a space of dimension \(n \leq 24\) ⋮ On some problems of Euclidean Ramsey theory ⋮ Better bounds for planar sets avoiding unit distances ⋮ Density estimates of 1-avoiding sets via higher order correlations ⋮ Open sets avoiding integral distances ⋮ A quantitative version of Steinhaus' theorem for compact, connected, rank-one symmetric spaces ⋮ A recursive Lovász theta number for simplex-avoiding sets ⋮ Geometrical sets with forbidden configurations ⋮ Odd distances in colourings of the plane ⋮ Spectral bounds for the independence ratio and the chromatic number of an operator ⋮ Polynomial configurations in sets of positive upper density over local fields ⋮ Book review of: Alexander Soifer, The mathematical coloring book. Mathematics of coloring and the colorful life of its creators ⋮ On a generalization of the Hadwiger-Nelson problem ⋮ The fractional chromatic number of the plane ⋮ Invariant Semidefinite Programs ⋮ Iterative Refinement for Linear Programming ⋮ Lower bounds for the measurable chromatic number of the hyperbolic plane ⋮ Lower bounds for measurable chromatic numbers ⋮ An Improvement on the Delsarte-Type LP-Bound with Application to MUBs ⋮ The density of sets avoiding distance 1 in Euclidean space ⋮ New lower bound for the chromatic number of a rational space with one and two forbidden distances ⋮ Complete positivity and distance-avoiding sets
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Measurable chromatic number of geometric graphs and sets without some distances in Euclidean space
- Lower bounds for measurable chromatic numbers
- A Szemerédi type theorem for sets of positive density in \(\mathbb R^k\)
- The realization of distances in measurable subsets covering \(R^ n\).
- Unsolved problems in geometry
- New upper bounds on sphere packings. I
- Bounds on the measurable chromatic number of \({\mathbb{R}}\)
- Metric spaces and completely monontone functions
- Plane Sets with Positive Density at Infinity Contain all Large Distances
- The Realization of small Distances in Plane Sets of Positive Measure
- Measurable sets with excluded distances
This page was built for publication: Fourier analysis, linear programming, and densities of distance avoiding sets in \(\mathbb R^n\)
