OpenAI reports the weak pinned planar distance theorem
- Mathematics
For every fixed ε>0, all but o(n) points of any n-point planar set determine at least n^(1−ε) distinct nonzero distances as n grows, uniformly over the set.
OpenAI reports the weak pinned planar distance theorem
- Mathematics
For every fixed ε>0, all but o(n) points of any n-point planar set determine at least n^(1−ε) distinct nonzero distances as n grows, uniformly over the set.
Curated contributions 1
Understand the problem ↓Understanding the problem
Read the background
For every fixed ε>0, all but o(n) points of any n-point planar set determine at least n^(1−ε) distinct nonzero distances as n grows, uniformly over the set.
Why it matters
If correct, resolves the weak pinned Erdős distinct-distance conjecture in a stronger almost-every-pin form.
What counts as progress
Do almost all pins in every large planar point set determine nearly n distinct distances?
Website timeline
Publication dates and editorial changes.