Planar distinct distances and unit-distance bounds
What the paper claims, in its own words
Proves the weak pinned Erdős distance conjecture: for every fixed ε > 0, all but points of any n-point planar set determine at least distinct nonzero distances. A complementary theorem bounds the number of unit-distance pairs by for an absolute δ > 0.
The plain-language explainer for this entry is still coming.
The original papers (2)
- The weak pinned planar distance theorem (PDF, opens in a new tab) September 23, 2026 Formal proof listed
- A power saving for planar unit distances (PDF, opens in a new tab) September 23, 2026