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.

Latest version

Checks complete

Sync OpenAI Math manuscripts from 4eaee87548250b2682affda7d05d947c05554bae

Committed

All papers

Claims

Findings

The crossing number of complete graphs

For every integer n≥3n \ge 3, the ordinary crossing number of the complete graph KnK_n is cr(Kn)=Z(n):=14⌊n2⌋⌊n−12⌋⌊n−22⌋⌊n−32⌋\mathrm{cr}(K_n) = Z(n) := \frac{1}{4} \lfloor \frac{n}{2} \rfloor \lfloor \frac{n-1}{2} \rfloor \lfloor \frac{n-2}{2} \rfloor \lfloor \frac{n-3}{2} \rfloor, resolving the Harary–Hill conjecture positively.

For every n≥3n \ge 3, cr(Kn)≥Z(n)\mathrm{cr}(K_n) \ge Z(n).

Every normalized minimum drawing of K2s+1K_{2s+1}, s≥2s \ge 2, has at least (s2)2\binom{s}{2}^2 crossings.

The evaluation map E:S→RTE : \mathcal{S} \to \mathbb{R}^{\mathcal{T}} is injective.

For any two cycles z,z′z, z', the corrected bilinear pairing satisfies J(z,z′)=0J(z, z') = 0.

The pairing MM on Ps−1,s−2×Ps−2,s−1\mathcal{P}_{s-1,s-2} \times \mathcal{P}_{s-2,s-1} is nonsingular; consequently, A∈Ps−2,s−2A \in \mathcal{P}_{s-2,s-2} and M(A,B)=0M(A, B) = 0 for every B∈Ps−1,s−1B \in \mathcal{P}_{s-1,s-1} implies A=0A = 0.

The endpoint-sum two-page semicircle drawing of KnK_n has exactly Z(n)Z(n) crossings for every n≥3n \ge 3.

For every finite simple graph, a minimum ordinary drawing can be chosen polygonal, straight near every vertex and crossing, and without crossings between edges having a common endpoint.

Methods

Normalize a minimum continuous-arc drawing into a polygonal drawing that is straight near vertices and crossings and free of adjacent-edge crossings using disk neighborhoods, polygonal approximation, and prefix exchange.

Source excerpts

“Lemma A.1. For every finite simple graph, a minimum ordinary drawing can be chosen polygonal, straight near every vertex and crossing, and without crossings between edges having a common endpoint.” · Show in paper

Relate interior signed crossings I(e,f)I(e,f) to local circular edge orders Tw(e,f)T_w(e,f) via a skew-symmetric bilinear form J(e,f)J(e,f) that vanishes on pairs of cycles, proved by perturbing shared tracks and averaging.

Source excerpts

“Define a bilinear form by its values on basis edges: J(e, f) = I(e, f) + 1/2 \sum_{w an endpoint of both e,f} \sigma_{we} \sigma_{wf} T_w(e, f).” · Show in paper

Construct an even-node order detector using Lagrange interpolation weights and two-triangle interpolation to force polynomials in the kernel of an evaluation map to vanish at shared endpoints.

Source excerpts

“The cycle identity retains the order of the spokes at each vertex. We next show that this order, combined with interpolation weights, detects a polynomial from its pairings with a prescribed test space.” · Show in paper

Bound the crossing number of K2s+1K_{2s+1} from below by showing that the injective image of a polynomial space S\mathcal{S} under evaluation at supported edge pairs is totally isotropic in a nondegenerate symmetric diagonal form on RT\mathbb{R}^{\mathcal{T}}.

Source excerpts

“The image W = E(S) is contained in its orthogonal complement. ... hence dim W^⊥ = |T| − dim W, and therefore 2 dim W ≤ |T|.” · Show in paper

Construct an explicit two-page semicircle drawing of KnK_n by assigning each edge ijij to one of two half-planes according to the residue i+j(modn)i + j \pmod n and choosing generic spine coordinates.

Source excerpts

“An edge ij uses the color of i + j (mod n). Draw first-color edges as semicircles above the spine and second-color edges as semicircles below it, in both cases with their endpoints as the diameter endpoints.” · Show in paper