OpenAI reports a power saving for planar halving lines
- Mathematics
Some absolute ε>0 and C bound the number of unordered halving pairs in every sufficiently large even n-point planar set with no three collinear by Cn^(4/3−ε).
OpenAI reports a power saving for planar halving lines
- Mathematics
Some absolute ε>0 and C bound the number of unordered halving pairs in every sufficiently large even n-point planar set with no three collinear by Cn^(4/3−ε).
Curated contributions 1
Understand the problem ↓Understanding the problem
Read the background
Some absolute ε>0 and C bound the number of unordered halving pairs in every sufficiently large even n-point planar set with no three collinear by Cn^(4/3−ε).
Why it matters
If correct, gives a fixed power improvement over the longstanding planar halving-line bound.
What counts as progress
Can the number of planar halving lines be bounded by a fixed power below n^(4/3)?
Website timeline
Publication dates and editorial changes.