Combinatorics · Oct 6, 2026
Planar distinct distances and unit-distance bounds
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.
Contributors
Unreleased OpenAI model
AI systems: Unreleased OpenAI model