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 strong thin tree conjecture

There is a universal constant C>0C > 0 such that, for every integer k≥1k \ge 1, every finite kk-edge-connected undirected multigraph without loops and with at least two vertices has a spanning tree TT satisfying ∣δT(S)∣≤Ck∣δG(S)∣|\delta_T(S)| \le \frac{C}{k}|\delta_G(S)| for every ∅≠S⊊V\emptyset \neq S \subsetneq V.

There is an absolute integer qH≥2q_H \ge 2 such that for each integer q≥qHq \ge q_H, if HH has a locally qq-connected hierarchy and M\mathcal{M} is any collection of its nonroot nodes satisfying ∣O(A)∣≥∣P(A)∣/q|O(A)| \ge |P(A)|/q, then HH has a shortcut matrix D≻0D \succ 0 satisfying 1STD1S≤∣δH(S)∣\mathbf{1}_S^{\mathsf{T}} D \mathbf{1}_S \le |\delta_H(S)| (∅≠S⊊V\emptyset \neq S \subsetneq V) and 1∣O(A)∣∑e∈O(A)RD(e)≤q−31/40\frac{1}{|O(A)|} \sum_{e \in O(A)} R_D(e) \le q^{-31/40} for all A∈MA \in \mathcal{M}.

For all sufficiently large integers rr, every rr-tree-packable graph HH on n≥2n \ge 2 vertices admits X≻0X \succ 0 such that LH⪯XL_H \preceq X, 1STX1S≤3∣δH(S)∣\mathbf{1}_S^{\mathsf{T}} X \mathbf{1}_S \le 3|\delta_H(S)| (∅≠S⊊V\emptyset \neq S \subsetneq V), and the edges with RX(e)≤4r−1/2R_X(e) \le 4r^{-1/2} contain q=⌊(1−r−1/16)r⌋q = \lfloor (1 - r^{-1/16})r \rfloor edge-disjoint spanning trees.

Let BB be the union of q≥1q \ge 1 edge-disjoint spanning trees on an nn-vertex set (n≥2n \ge 2). For every ρ>0\rho > 0, there are vectors ze∈Rn−1z_e \in \mathbb{R}^{n-1} indexed by e∈E(B)e \in E(B) such that ∑e∈BzezeT=In−1\sum_{e \in B} z_e z_e^{\mathsf{T}} = I_{n-1}, ∥ze∥2≤(1+ρ)/q\|z_e\|^2 \le (1+\rho)/q, and ze=seMbez_e = s_e M b_e for an invertible linear map M:1⊥→Rn−1M : \mathbf{1}^\perp \to \mathbb{R}^{n-1} and se>0s_e > 0 (preserving all subset ranks). Moreover, if A⊆E(B)A \subseteq E(B) satisfies ∑e∈AzezeT⪰cIn−1\sum_{e \in A} z_e z_e^{\mathsf{T}} \succeq c I_{n-1} for c>0c > 0, then (V,A)(V, A) contains at least ⌊cq/(1+ρ)⌋\lfloor cq/(1+\rho) \rfloor edge-disjoint spanning trees.

There is an absolute integer rstepr_{\mathrm{step}} such that for every integer r≥rstepr \ge r_{\mathrm{step}}, if HH has at least two vertices and contains rr edge-disjoint spanning trees, then HH has a spanning subgraph H′H' containing at least r′=⌊(1−4u)r/2⌋r' = \lfloor (1 - 4u)r / 2 \rfloor edge-disjoint spanning trees (where u=r−1/16u = r^{-1/16}, ϵ=6r−1/2\epsilon = 6r^{-1/2}, τ=2ϵ+ϵ\tau = 2\sqrt{\epsilon} + \epsilon) such that every nonempty proper S⊂V(H)S \subset V(H) satisfies ∣δH′(S)∣≤(1/2+3τ)∣δH(S)∣|\delta_{H'}(S)| \le (1/2 + 3\tau)|\delta_H(S)|, with 516≤r′r≤12\frac{5}{16} \le \frac{r'}{r} \le \frac{1}{2} and 1/2+3τr′/r≤1+15u\frac{1/2 + 3\tau}{r'/r} \le 1 + 15u.

Methods

Shortcut matrix extraction via dyadic-binning hierarchy and Brouwer fixed-point limit on a compact convex set of cut-bounded matrices.

Source excerpts

“In each occupied bin 2a ≤ Ms < 2a+1, a ≥ 0, choose the finest partition that occurs in that bin. List the chosen partitions in order from fine to coarse as P0, . . . , Pℓ−1, with crossing sets Bi and sizes Mi.” · Show in paper

“The map Φp(Z) = ∑Np j=1 ϕp,j (Z)Yp,j is a continuous self-map of the compact convex set K. Theorem C.1 gives Xp = Φp(Xp). Pass to a subsequence along which Xp → X ∈ K.” · Show in paper

Rank-preserving isotropic vector representation of a tree packing via log-determinant variational normalization.

Source excerpts

“For a ∈ RE(B), set N(a) = ∑ e∈B exp(ae)bebTe, h(a) = log det N(a) − 1/q ∑ e∈B ae.” · Show in paper

“Define ze = exp(ae/2)N(a)−1/2be. Their outer products sum exactly to the identity, and the gradient bound gives their asserted norm bound.” · Show in paper

Two-sided spectral and packing-preserving sparsification via Marcus-Spielman-Srivastava on stacked incidence and isotropic vectors.

Source excerpts

“Independently for each e, let ve ∈ R2D equal (we, 0) or (0, we), each with probability 1/2.” · Show in paper

“Apply Lemma 5.1 to B with ρ = u, and put ae = X−1/2be, we = (ae, ze), Σ = ∑ e∈B wewTe.” · Show in paper

Dual-to-embedding reduction and geometric bag-charging for locally connected hierarchies.

Source excerpts

“We prove Theorem 3.2 by the dual and geometric method of Anari and Oveis Gharan [1]. Lemma B.1 reduces the matrix bound to an inequality for binary embeddings. Proposition B.7 captures the relevant boundary sums in geometric families of balls; Propositions B.8 and B.10 bound their total radii by graph length.” · Show in paper