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
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
- remark: Remark: Family 155. A counterexample to periodic tiling in dimension three
- remark: Remark: Family 156. Borsuk's conjecture fails in dimension nine
- remark: Remark: Family 157. Counterexamples to the Hadwiger and Colin de Verdi conjectures
- remark: Remark: Family 158. The Euclidean plane cannot be colored with five colors
- remark: Remark: Family 159. Erd (o)s's reciprocal-sum conjecture and quasipolynomial Szemerédi bounds
- remark: Remark: Family 160. Superexponential van der Waerden numbers
- remark: Remark: Family 161. Counterexamples to Sidorenko's conjecture and the forcing conjecture
- remark: Remark: Family 162. Counterexamples to Ryser's covering and Gyárfás's tree-cover conjectures