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

Disk transfer representations and confined bridge mass

There is a constant C0<∞C_0 < \infty such that, for every fixed C≥C0C \geq C_0, critical honeycomb bridges crossing a strip of width R∈32Z>0R \in \frac{3}{2}\mathbb{Z}_{>0} with initial port fixed and terminal port summed satisfy BC(R)≍B(R)≍R−1/4B_C(R) \asymp B(R) \asymp R^{-1/4}, MC(R)=R13/12+o(1)M_C(R) = R^{13/12+o(1)}, and M(R)=R13/12+o(1)M(R) = R^{13/12+o(1)}, so the mean number of visited vertices is R4/3+o(1)R^{4/3+o(1)} both under the unrestricted critical bridge law and under its restriction to the fixed corridor sup⁡y∈γ∣ξ(y)∣≤CR\sup_{y \in \gamma} |\xi(y)| \leq CR.

As the scale tends to infinity, the half-plane arch kernel h(m)h(m) is nonincreasing and satisfies h(m)≍m−5/4h(m) \asymp m^{-5/4}, and the unnormalized critical arch measure μ\mu satisfies μ(height>R)≍μ(diameter>R)≍R−1/4\mu(\text{height} > R) \asymp \mu(\text{diameter} > R) \asymp R^{-1/4}.

For every sufficiently large fixed CC, normalizing the half-plane arch measure μ\mu either on R≤diameter≤CRR \leq \text{diameter} \leq CR or on height≥R\text{height} \geq R and diameter≤CR\text{diameter} \leq CR yields Eℓ=R4/3+o(1)\mathbb{E}\ell = R^{4/3+o(1)}.

In the equilateral triangle DR={y:ei⋅y<R,i=0,1,2}D_R = \{y : e_i \cdot y < R, i = 0,1,2\} with inner triangle IR={v:ei⋅v<(1−ε)R,i=0,1,2}I_R = \{v : e_i \cdot v < (1-\varepsilon)R, i = 0,1,2\} for sufficiently small fixed ε>0\varepsilon > 0, summing critical chord weights over ordered pairs of boundary ports and normalizing on chords visiting IRI_R gives visit probability R−2/3+o(1)R^{-2/3+o(1)} uniformly for v∈IRv \in I_R, and both the expected total number of visited vertices and the expected number in IRI_R are R4/3+o(1)R^{4/3+o(1)}.

On a cylinder with NN sites around its circumference, the single upper-half-cylinder arch mass hN(m)h_N(m) satisfies 1−2cos⁡(3π/8)∑m=1N−1hN(m)≍N−1/41 - 2\cos(3\pi/8) \sum_{m=1}^{N-1} h_N(m) \asymp N^{-1/4}.

On the unit-edge honeycomb cylinder of period 2nU2nU, n≥3n \geq 3, the partition function Vn,n(0)V_{n,n}(0) of collections of vertex-disjoint finite simple polygons separating two opposite seam face centers ff and f+nUf + nU with weight 2x∣γ∣2x^{|\gamma|} per polygon satisfies Vn,n(0)=n1/6+o(1)V_{n,n}(0) = n^{1/6+o(1)}.

For a lattice face center ff in the plane, the sum ZR(f)Z_R(f) over collections of pairwise vertex-disjoint simple polygons all enclosing ff with vertices in the Euclidean ball of radius RR about ff and weight 2x∣γ∣2x^{|\gamma|} per polygon satisfies ZR(f)=R1/12+o(1)Z_R(f) = R^{1/12+o(1)}.

For an equilateral triangle DD of size comparable to HH with cut offsets averaged independently over intervals of length comparable to HH, and a vertex vv at distance ≳H\gtrsim H from the sides, the averaged mass of ordered chords through vv with endpoint gap ∣b−a∣≥H1−ϵ|b-a| \geq H^{1-\epsilon} satisfies ⟨∑∣b−a∣≥H1−ϵKab⟩=Hz+o(1)\langle \sum_{|b-a| \geq H^{1-\epsilon}} K_{ab} \rangle = H^{z+o(1)} for every fixed ϵ>0\epsilon > 0.

Methods

Nonbacktracking parafermionic boundary exploration in bounded convex polygons to obtain complex turn-weighted chord identities and positive mass bounds.

Source excerpts

“Start at a port a and explore inward. At each fresh vertex take the two nonbacktracking turns by ±π/3, with complex weights xe±isπ/3. Their sum is one. Stop at the first exit or the first repeated vertex, before choosing another turn there.” · Show in paper

Rapidity-deformed dilute-loop transfer matrix on a cylinder, finite permutation-orbit endpoint transport, and reduction to a Cauchy-matrix inverse pairing via a scalar commutant.

Source excerpts

“For N ≥ 3 and generic distinct rapidities sufficiently near zero, define Cij = 1/(xi + qxj) (1 ≤ i, j ≤ N). Then ∑_i xi − c ∑_{i≠j} ei(ηi+ηj)Hij(η) = 1T(CT + qC)−11.” · Show in paper

Polynomial interpolation of the disk transfer vector on fusion hyperplanes using a Pfaffian scalar specialization.

Source excerpts

“The induction first prescribes the vector on every fusion hyperplane, then interpolates the polynomial components. Compatibility of the prescriptions is the essential point: it makes interpolation independent of the occupied endpoint chosen for the construction.” · Show in paper

Scalar-gas representation of the twisted disk-vector pairing and encoding of occupied sites as contour-integral residues.

Source excerpts

“The finite scalar identity has one nonzero label at most at each site. We encode its occupied sites as residues of contour integrals.” · Show in paper

Elliptic periodization of the contour-residue gas, Frenkel-Kac-Segal level-one oscillator trace representation, and Weyl current reflection.

Source excerpts

“We represent the elliptic gas as a trace so that a current reflection can exchange the interaction matrix with its inverse.” · Show in paper

Coercive quadratic-form decomposition, circular Poisson smearing of compound residue particles, and complex-period continuation.

Source excerpts

“Replace elementary point rows by smeared measures in the s-variable using the circular Poisson kernel Pρ of width ρ = (B + N + 2)−4 (convolution multiplier e−|m|ωρ, positive density proportional to (1 − 2e−ωρ cos(ωs) + e−2ωρ)−1, mass one).” · Show in paper

Relative moment determinant comparison and Meixner-Pollaczek polynomial projection kernel estimates for the homogeneous Pfaffian normalization.

Source excerpts

“We compare two moment determinants. One is the confluent limit of the Pfaffian squared. The other has a Cauchy determinant that can be evaluated exactly. The comparison leaves a multiplication operator compressed to a polynomial space; its logarithmic determinant supplies the power 5/24.” · Show in paper

Harmonic upper-bound equality propagation via rectangular barriers and the subharmonic maximum principle.

Source excerpts

“Lemma 7.2 (Propagation of equality in a harmonic upper bound).” · Show in paper

Vacancy-moving telescoping identities among ordered strip bridges to bound adjacent-bridge and polygon-shape masses.

Source excerpts

“Moving the extra source among the bottom roots cancels its first collisions with those bridges.” · Show in paper

Marked three-leg exploration identity and independent wall-offset averaging to retain bulk-visit mass with separated chord endpoints.

Source excerpts

“The identity becomes useful after summing against a slowly decaying endpoint weight. Its positive intersecting-pair terms force every marked chord to meet many ordinary chords.” · Show in paper

Recoverable two-arm sewing through widening tubes and bends, controlled by a weighted second-moment Cauchy-Schwarz inequality.

Source excerpts

“If distinct paths ξ have positive weights wξ and nonnegative representation weights m(ξ), with 0 < ∑_ξ wξm(ξ)2 < ∞, then ∑_{ξ:m(ξ)>0} wξ ≥ (∑_ξ wξm(ξ))2 / ∑_ξ wξm(ξ)2.” · Show in paper