The density of planar sets avoiding unit distances
Gergely Ambrus, Adrián Csiszárik, Máté Matolcsi, Dániel Varga, Pál Zsámboki
Early discovery. Linked by one identifiable commenter. This paper is outside the main ranking; a mention is not an endorsement.
Abstract
By improving upon previous estimates on a problem posed by L. Moser, we prove a conjecture of Erdős that the density of any measurable planar set avoiding unit distances cannot exceed $1/4$. Our argument implies the upper bound of $0.2470$.
arXiv comments
24 pages, 6 figures. Final version, to appear in Mathematical Programming
The question of what is an Erdős problem and what is not is not black and white. My team has managed to solve a problem that's sort of an Erdős problem. In the early sixties, Leo Moser asked about the value of some quantity. In a 1985 paper, Erdős commented that the quantity…
The question of what is an Erdős problem and what is not is not black and white. My team has managed to solve a problem that's sort of an Erdős problem. In the early sixties, Leo Moser asked about the value of some quantity. In a 1985 paper, Erdős commented that the quantity…
skinner_View on HNParent context