The density of planar sets avoiding unit distances
From MaRDI portal
Publication:6608036
DOI10.1007/S10107-023-02012-9zbMATH Open1547.42016MaRDI QIDQ6608036FDOQ6608036
Authors: Gergely Ambrus, Adrián Csiszárik, Máté Matolcsi, Dániel Varga 
Publication date: 19 September 2024
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Linear programming (90C05) 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)
Cites Work
- Research Problems in Discrete Geometry
- The realization of distances in measurable subsets covering \(R^ n\).
- The density of sets avoiding distance 1 in Euclidean space
- The Mathematical Coloring Book
- The realization of distances within sets in Euclidean space
- Fourier analysis, linear programming, and densities of distance avoiding sets in \(\mathbb R^n\)
- Title not available (Why is that?)
- Better bounds for planar sets avoiding unit distances
- Title not available (Why is that?)
- Title not available (Why is that?)
- Measurable chromatic number of geometric graphs and sets without some distances in Euclidean space
- Title not available (Why is that?)
- A counterexample to a conjecture of Larman and Rogers on sets avoiding distance 1
- The fractional chromatic number of the plane
- The chromatic number of the plane is at least 5: a new proof
- The chromatic number of the plane is at least 5
- Complete positivity and distance-avoiding sets
- Density estimates of 1-avoiding sets via higher order correlations
- On the density of sets of the Euclidean plane avoiding distance 1
- Metric spaces and completely monotone functions.
- A treatise on the theory of Bessel functions.
This page was built for publication: The density of planar sets avoiding unit distances
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6608036)
