Manuscript OpenAI@2026-10-07 · OpenAI.tex · remark · 6a931f8f

Remark: Family 183. Power savings for planar halving lines and k -sets

Family claims › Combinatorics · lines 1261–1266

OpenAI@2026-10-07#rem:oai-183

Back to manuscript

Improves the planar halving-line bound to for sets with no three collinear and an absolute . More generally, an -point set with no three collinear has strictly separable -subsets for , with an absolute . The constants and positive exponents are nonquantitative.

The authors are OpenAI. This companion does not verify the proof. The claim is not a theorem of the Enter series and not a premise of any registered sheet. It does not close O.1. O.1 stays NOT_CLOSED. It is not a de Sitter state and not the QdS external-leg scheme. No quantum coefficient is admitted. No compilation is asserted.

Nearby in this section