Better bounds for planar sets avoiding unit distances

DOI10.1007/s00454-015-9751-5zbMath1335.05048arXiv1501.00168OpenAlexW1487855796MaRDI QIDQ282753

Máté Matolcsi, Imre Z. Ruzsa, Fernando Mário de Oliveira Filho, Tamás Keleti

Publication date: 12 May 2016

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1501.00168

zbMATH Keywords

linear programmingharmonic analysischromatic number of Euclidean spacedistance-avoiding sets

Mathematics Subject Classification ID

Linear programming (90C05) Planar graphs; geometric and topological aspects of graph theory (05C10) Erd?s problems and related topics of discrete geometry (52C10) Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17) Fourier series and coefficients in several variables (42B05)

Related Items

On the density of sets of the Euclidean plane avoiding distance 1, Density estimates of 1-avoiding sets via higher order correlations, Lower bounds for the measurable chromatic number of the hyperbolic plane, On the density of sets avoiding parallelohedron distance 1, Complete positivity and distance-avoiding sets

Uses Software

• SageMath

Cites Work

• Unnamed Item
• Unnamed Item
• Fourier analysis, linear programming, and densities of distance avoiding sets in \(\mathbb R^n\)
• Measurable chromatic number of geometric graphs and sets without some distances in Euclidean space
• The realization of distances in measurable subsets covering \(R^ n\).
• Intersection theorems with geometric consequences
• Bounds on the measurable chromatic number of \({\mathbb{R}}\)
• The density of sets avoiding distance 1 in Euclidean space
• Metric spaces and completely monontone functions
• The Mathematical Coloring Book
• The Brunn-Minkowski inequality
• Quantitative stability in the isodiametric inequality via the isoperimetric inequality
• The realization of distances within sets in Euclidean space