<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>The density of planar sets avoiding unit distances · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2207.14179/</link><description>Collected HN comments and submissions linking this paper.</description><language>en</language><lastBuildDate>Mon, 02 Nov 2026 11:16:22 GMT</lastBuildDate><atom:link href="https://hackerpaper.kaipfister.de/p/2207.14179/feed.xml" rel="self" type="application/rss+xml" /><item><title>The density of planar sets avoiding unit distances — mentioned by skinner_</title><link>https://news.ycombinator.com/item?id=40093869</link><guid isPermaLink="false">urn:hackerpapers:mention:2207.14179:40093869</guid><pubDate>Sat, 20 Apr 2024 01:46:16 GMT</pubDate><description>&lt;p&gt;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&amp;#x27;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 “seems likely” to be less than 1/4. It was known to be at most 2/7. After a long line of improvements by several teams, we were the first ones to go below 1/4. For those who are interested, https://www.sfu.ca/~vjungic/RamseyProjects/section-11.html describes the question. Our answer is at https://arxiv.org/abs/2207.14179…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2207.14179/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>math.MG</category></item></channel></rss>
