By OpenAISourceGitHub

Manuscripts from openai/math

Fork
Clone
git clone https://openversions.com/git/index/openai-math.git
Cite
Version link
https://openversions.com/index/openai-math/commit/dfd8c46870b48511e697cbb43a3c8c91d375fa2f
Version identifier (commit hash)
dfd8c46870b48511e697cbb43a3c8c91d375fa2f

Fork to create your own copy with credit to the source. Clone to get a Git copy on your computer.

All papers

Claims

Findings

The higher-dimensional Erdős distinct-distances conjecture

For every integer d≥3d \ge 3, there is a constant cd>0c_d > 0 depending only on dd such that every finite set P⊂RdP \subset \mathbb{R}^d of n≥2n \ge 2 distinct points satisfies ∣Δ(P)∣≥cdn2/d|\Delta(P)| \ge c_d n^{2/d}.

In the contradiction regime with M=o(A)M = o(A), one cannot assign to each p∈Pp \in P a family CpC_p of irreducible projective curves in Pd−1\mathbb{P}^{d-1}, each spanning projective dimension at most two, with deg⁡Cp≤E=δN/A\deg C_p \le E = \delta N/A and δ→0\delta \to 0, such that 1−o(1)1 - o(1) of the unordered pairs {p,q}\{p, q\} satisfy πp(q)∈Cp\pi_p(q) \in C_p or πq(p)∈Cq\pi_q(p) \in C_q.

There are absolute constants Crich,Krich>0C_{\text{rich}}, K_{\text{rich}} > 0 such that for any set P⊂R3P \subset \mathbb{R}^3 of N≥2N \ge 2 distinct points with A=N2/3A = N^{2/3} and M=1+∣Δ(P)∣≤AM = 1 + |\Delta(P)| \le A, the rigid motions g(x)=Sx+hg(x) = Sx + h (S∈O(3)S \in O(3), h∈R3h \in \mathbb{R}^3) satisfying kg=∣gP∩P∣≥CrichAk_g = |gP \cap P| \ge C_{\text{rich}} A form a finite set and ∑g:kg≥CrichAkg2≤KrichN4/A\sum_{g: k_g \ge C_{\text{rich}} A} k_g^2 \le K_{\text{rich}} N^4 / A, and the same estimate holds with kg=∣gP∩Q∣k_g = |gP \cap Q| for any rigidly congruent copy QQ of PP.

For fixed C0≥1C_0 \ge 1, A≥1A \ge 1, and a finite set P\mathcal{P} of distinct parameters [v:y]∈Q[v : y] \in \mathcal{Q} with v≠0v \ne 0 admitting degree-O(C0A)O(C_0 A) homogeneous separators and at most C0Ar−1C_0 A^{r-1} members in any projective Pr⊂Q\mathbf{P}^r \subset \mathcal{Q}, there is a constant C=C(e,C0)C = C(e, C_0) such that #{λ∈P:Fλ⊂V}≤Cdeg⁡(V)Ah\#\{\lambda \in \mathcal{P} : F_\lambda \subset V\} \le C \deg(V) A^h for irreducible proper affine varieties V⊂SV \subset S of dimension s0+hs_0 + h (1≤h<r1 \le h < r), both when all such VV are allowed with ∣P∣≤C0Ar|\mathcal{P}| \le C_0 A^r, and when only VV contained in the zero set of a nonzero polynomial of degree at most C0AC_0 A are allowed without a bound on ∣P∣|\mathcal{P}|.

After passing to a subsequence, a further symmetric selection S\mathcal{S} retains at least c′N2c' N^2 pairs such that the direction-evaluation vectors of the partners in each star are linearly independent for homogeneous polynomials of degree D=⌊A⌋D = \lfloor A \rfloor, and in particular each selected star admits homogeneous separators of degree DD.

The pruned equal-distance graph H\mathcal{H} cannot satisfy both the global concentration bound (Lemma 2.4) and the local concentration bound (Lemma 2.5).

Methods

Contradiction-regime reduction in the least failing dimension d≥3d \ge 3 using symmetric direction selection with independent degree-⌊A⌋\lfloor A \rfloor evaluations, equal-distance pair flats in skew-form space, and a single random sample rank contradiction.

Source excerpts

“Suppose that Theorem 1.1 fails, and take the least dimension d ≥ 3 in which it fails. There is then a sequence of finite sets P ⊂ Rd for which, with N = |P|, M = 1 + |∆(P)|, B = N1/d, A = B2, N → ∞, M/A → 0.” · Show in paper

“Choose each flat independently with a small fixed probability θ > 0. With probability at least 1/2, the number selected is at most 2θm, by Markov’s inequality.” · Show in paper

Multiscale polynomial scale profiles partitioning the sample into a core and dyadic-width non-core pieces with chains of proper hypersurface cuts, balanced degree budgets, and product-testing lemmas.

Source excerpts

“Proposition 5.1 (Multiscale partition). There are s∗ → ∞ and partitions of all but o(N) sample points into a core and non-core pieces with the following properties.” · Show in paper

“Lemma 5.4 (Product testing). Take two pieces, or the pooled pieces described above, in a common window with the same limiting profile.” · Show in paper

Secant-tangent geometry and terminal-curve deletion controlling radial projections of physical varieties and curves.

Source excerpts

“Lemma 4.1 (Secants and a particular-pair version).” · Show in paper

“Proposition 4.3 (Terminal-curve deletion).” · Show in paper

Spatial subdivision into dyadic cubes and cubes with one dyadic hole with uniform overlap under rigid motions, combined with null three-flats, polynomial descent, and rich-line counting in R3\mathbb{R}^3.

Source excerpts

“Lemma 7.4 (Local motion bound).” · Show in paper

“Lemma 7.5 (Subdivision into cubes and cubes with one hole).” · Show in paper

Approximate complete intersections, regular defining equations of controlled degree, and controlled ruling incidences via projective-bundle Segre-class formulas for evaluation flats of alternating forms.

Source excerpts

“Theorem A.2 (Approximate complete intersection).” · Show in paper

“Lemma A.6 (Controlled ruling incidences).” · Show in paper