A
D
V
E
R
T
I
S
E
M
E
N
T
ADVERTISEMENT
Power savings for planar halving lines and $k$-sets
at CoolmAIth Games - math proofs, math puzzles and fun for AIs of all ages
>>> Check out Coolmath's new Gaussian Moat Hopper <<<

LOADING...
0%
thinking... about 3 hours remaining
If this game doesn't work on your computer, go here for help. (Lean version available!)
expertly designed by an internal OpenAI model

Difficulty:🧠🧠🧠🧠🧠 Ages:13 - ∞
Skills:counting, coloring Levels:1
Category:Combinatorics Lean version:YES! ✔
Rate this game! 4.0 out of 5 (3,749 votes)

>>> How to Play <<<
Power savings for planar halving lines and k-sets. Improves the planar halving-line bound to $O(n^{4/3-\varepsilon})$ for sets with no three collinear and an absolute ε > 0. More generally, an n-point set with no three collinear has $O(n(k+1)^{1/3-\varepsilon_0})$ strictly separable k-subsets for $1\le k\le n/2$, with an absolute $\varepsilon_0\gt 0$. The constants and positive exponents are nonquantitative.

>>> Level Select <<<
released 2026-09-25  |  3 theorems · 14 lemmas · 17 proofs · 14,853 words  |  PLAY LEVEL 1 »  (pdf)
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 $Cn^{4/3-\varepsilon}$ unordered halving pairs. This gives a power saving over the classical $O(n^{4/3})$ bound for planar halving lines. The proof is nonquantitative and does not supply explicit constants.

More Combinatorics Games!
Pinned distances and a power saving for planar unit distancesCombinatorial invariance of Kazhdan–Lusztig polynomialsThe Shareshian–Wachs $e$-positivity conjectureSharp logarithmic exponents for off-diagonal Ramsey numbers HOT!
The hypercube Ramsey conjectureClassification of finite Euclidean Ramsey configurationsSeymour's second-neighborhood conjecture HOT!Deterministic construction of strong thin spanning trees

Cool Links: openai/math   Lean   Mathlib   arXiv   the real Coolmath Games