OctoInformBeta

OpenAI preprint, September 2026 · §1. Introduction

Theorem 1.1: An absolute improvement on the exponent 4/34/3 for sufficiently large even planar configurations in general position

A power saving for halving pairs.

Hover over a blue or green term in the text, or a node in the graph, to find it in the other. Select it to read its declaration both in Lean and in words.

The Setting

The extremal question concerns how many pairs of a planar configuration can divide its remaining points evenly. A planar point is a pair of real numbers, and an nn-point configuration is an indexed map P:{0,…,n−1}→ℝ2P:\{0,\ldots,n-1\}\to\mathbb R^2.✦ Write Pi=P(i)P_i=P(i).

The orientation determinant of points p,q,r∈ℝ2p,q,r\in\mathbb R^2 is the real number orient⁡(p,q,r)\operatorname{orient}(p,q,r) defined in (1): orient⁡(p,q,r)=(q1−p1)(r2−p2)−(q2−p2)(r1−p1).\operatorname{orient}(p,q,r) =(q_1-p_1)(r_2-p_2)-(q_2-p_2)(r_1-p_1).(1)✦ A configuration PP is in general position if its points are distinct and no three of them are collinear.✦

For an nn-point planar configuration PP and indices i,j∈{0,…,n−1}i,j\in\{0,\ldots,n-1\}, the left-side count LP(i,j)L_P(i,j) is the number of indices whose points have positive orientation relative to Pi,PjP_i,P_j, as defined in (2): LP(i,j)=#{ℓ∈{0,…,n−1}:orient⁡(Pi,Pj,Pℓ)>0}.L_P(i,j)=\#\{\ell\in\{0,\ldots,n-1\}: \operatorname{orient}(P_i,P_j,P_\ell)>0\}.(2) For an nn-point planar configuration PP, the halving-pair count h(P)h(P) is the number of unordered index pairs whose two side counts have the prescribed value in (3): h(P)=#{(i,j):0≤i<j<n,LP(i,j)=LP(j,i)=⌊max⁡{n−2,0}2⌋}.h(P)=\#\left\{(i,j):0\le i<j<n,\quad L_P(i,j)=L_P(j,i)=\left\lfloor\frac{\max\{n-2,0\}}{2}\right\rfloor\right\}.(3)

The Claim

Theorem 1. There are absolute constants ε>0\varepsilon>0, C∈ℝC\in\mathbb R and n0∈ℕn_0\in\mathbb N with the following property. Let n≥n0n\ge n_0 be even, and let PP be an nn-point planar configuration in general position. Then the bound (4) holds: h(P)≤Cn4/3−ε.h(P)\le Cn^{4/3-\varepsilon}.(4)✦

What Is Checked

The claim is stated over indexed planar configurations in general position, with h(P)h(P) defined by the two orientation side counts.