The density of planar sets avoiding unit distances
- 6 October 2023
- journal article
- research article
- Published by Springer Nature in Mathematical Programming
- Vol. 207 (1-2) , 303-327
Abstract
No abstract availableKeywords
All Related Versions
Funding Information
- Nemzeti Kutatási Fejlesztési és Innovációs Hivatal (KKP-133819)
- Nemzeti Kutatási, Fejlesztési és Innovaciós Alap (TKP2021-NVA-09, TKP2021-NKTA-62, 132097, 129335)
- European Research Council (Geoscape)
This publication has 18 references indexed in Scilit:
- SymPy: symbolic computing in PythonPeerJ Computer Science, 2017
- The fractional chromatic number of the planeCombinatorica, 2016
- Better Bounds for Planar Sets Avoiding Unit DistancesDiscrete & Computational Geometry, 2015
- The Density of Sets Avoiding Distance 1 in Euclidean SpaceDiscrete & Computational Geometry, 2015
- Fourier analysis, linear programming, and densities of distance avoiding sets in $\mathbb{R}^n$Journal of the European Mathematical Society, 2010
- PROBLEMS AND RESULTS IN COMBINATORIAL GEOMETRYaAnnals of the New York Academy of Sciences, 1985
- Measurable chromatic number of geometric graphs and sets without some distances in euclidean spaceCombinatorica, 1984
- The realization of distances in measurable subsets covering RnJournal of Combinatorial Theory, Series A, 1981
- The realization of distances within sets in Euclidean spaceMathematika, 1972
- Metric Spaces and Completely Monotone FunctionsAnnals of Mathematics, 1938