Preprint in the OpenAI Math release
A power saving for planar halving lines
OpenAI
Abstract
There are absolute constants ε > 0 and C such that every sufficiently large even n-point set in the plane with no three collinear has at most unordered halving pairs. This gives a power saving over the classical bound for planar halving lines. The proof is nonquantitative and does not supply explicit constants.
open until 1 Jan 2028
est. 50% chance this result is independently verified by the end of 2027.
Not verified 50%Verified 50%
What do you think this paper will get?
All positions stay anonymous.
Discussion (0)
Sign in to comment.