Planar distinct distances and unit-distance bounds

Formal proof listed 2 papers September 23, 2026
What the paper claims, in its own words

Proves the weak pinned Erdős distance conjecture: for every fixed ε > 0, all but o(n)o(n) points of any n-point planar set determine at least n1−εn^{1-\varepsilon} distinct nonzero distances. A complementary theorem bounds the number of unit-distance pairs by O(n4/3−δ)O(n^{4/3-\delta}) for an absolute δ > 0.

The plain-language explainer for this entry is still coming.

The original papers (2)