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

A Cyclic Polytabloid Proof of Saxl's Conjecture

For every integer m≥1m \ge 1 and every partition λ⊢Nm=m(m+1)/2\lambda \vdash N_m = m(m+1)/2, the Kronecker coefficient g(ρm,ρm,λ)>0g(\rho_m, \rho_m, \lambda) > 0, where ρm=(m,m−1,…,1)\rho_m = (m, m-1, \dots, 1); equivalently, Sρm⊗SρmS^{\rho_m} \otimes S^{\rho_m} contains every irreducible complex representation of SNmS_{N_m}.

For every m≥1m \ge 1 and every partition λ⊢Nm\lambda \vdash N_m, the irreducible representation SλS^\lambda occurs in the cyclic module Wm=C[SBm](vRm⊗vCm)W_m = \mathbb{C}[S_{B_m}](v_{R_m} \otimes v_{C_m}).

If m≥1m \ge 1, λ⊢Nm\lambda \vdash N_m, and ρm⊵λ\rho_m \unrhd \lambda, then SλS^\lambda occurs in WmW_m.

For s∈{1,2}s \in \{1, 2\}, h=m−s≥1h = m - s \ge 1, D=BhD = B_h, and F=Bm∖DF = B_m \setminus D, there is a surjective SBmS_{B_m}-equivariant map Wm↠IndSD×SFSBm(Wh⊠Um,s)W_m \twoheadrightarrow \mathrm{Ind}_{S_D \times S_F}^{S_{B_m}}(W_h \boxtimes U_{m,s}).

For every m≥3m \ge 3 and every partition η⊢2m−1\eta \vdash 2m-1 with len(η)≤4\mathrm{len}(\eta) \le 4, the irreducible module SηS^\eta occurs in Um,2U_{m,2}.

Let m≥2m \ge 2 and λ⊢Nm\lambda \vdash N_m. If λ\lambda is not dominated by ρm\rho_m, then either (i) there is a partition ν⊢Nm−1\nu \vdash N_{m-1} such that λ/ν\lambda/\nu is a horizontal strip of size mm, or (ii) m≥5m \ge 5 and there are partitions ν=λ(0)⊂λ(1)⊂⋯⊂λ(q)=λ\nu = \lambda^{(0)} \subset \lambda^{(1)} \subset \cdots \subset \lambda^{(q)} = \lambda with q≤4q \le 4, ν⊢Nm−2\nu \vdash N_{m-2}, and every λ(i)/λ(i−1)\lambda^{(i)}/\lambda^{(i-1)} a nonempty horizontal strip of total size 2m−12m-1.

Methods

Constructing a cyclic module Wm=C[SBm](vRm⊗vCm)W_m = \mathbb{C}[S_{B_m}](v_{R_m} \otimes v_{C_m}) inside Sρm⊗SρmS^{\rho_m} \otimes S^{\rho_m} generated by alternating row and column block polytabloids on the triangular position set BmB_m.

Source excerpts

“With Em = Cm and its ordered basis e1, . . . , em, form the alternating block tensors of Lemma 2.1 and set wm = vRm ⊗ vCm, Wm = C[Gm]wm ⊆ E⊗Bm m ⊗ E⊗Bm m .” · Show in paper

Detecting constituents dominated by ρm\rho_m via a sign twist, signed diagonal averaging over the row subgroup HRH_R, and a GG-equivariant content-projection map Q:Em⊗Bm⊗Em⊗Bm→MαQ: E_m^{\otimes B_m} \otimes E_m^{\otimes B_m} \to \mathcal{M}_\alpha.

Source excerpts

“Regroup the two input layers by position, using ordinary tensor reassociation, and apply q at every position. Then project onto the span Mα of words in which letter r occurs exactly r times for 1 ≤ r ≤ m, and no letter greater than m occurs.” · Show in paper

Using a coordinate-sector projection Ps=ps⊗BmP_s = p_s^{\otimes B_m} separating a smaller triangle Bm−sB_{m-s} from a band of width s∈{1,2}s \in \{1, 2\} to realize the full induced module IndSD×SFSBm(Wh⊠Um,s)\mathrm{Ind}_{S_D \times S_F}^{S_{B_m}}(W_h \boxtimes U_{m,s}) as a quotient of WmW_m.

Source excerpts

“On a pair-letter basis vector define ps(ea ⊗ eb) = { ea ⊗ eb, a, b ≤ s or a, b > s, 0, otherwise, Ps = p⊗Bm s .” · Show in paper

Detecting four-row constituents in the width-two band module Um,2U_{m,2} via an indexed path contraction into Mat2(C)\mathrm{Mat}_2(\mathbb{C}), an alternating segment basis {I,Z,T,J}\{I, Z, T, J\}, and simultaneous GL2(C)\mathrm{GL}_2(\mathbb{C})-conjugation of the dual-polytabloid test basis.

Source excerpts

“Choose an eigenvector v of B with eigenvalue β; invertibility gives β ̸= 0. Choose Q taking v to the first coordinate vector and set Ni = QMiQ−1.” · Show in paper

Reducing non-dominated partitions λ⊢Nm\lambda \vdash N_m to smaller staircases Nm−1N_{m-1} or Nm−2N_{m-2} by removing bottom boxes of rightmost columns in at most four horizontal-strip sweeps.

Source excerpts

“Perform full sweeps until the remaining number of boxes to be removed is at most the number of nonempty columns, then remove that number of bottom boxes from the rightmost columns.” · Show in paper