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

Elementary positivity of chromatic quasisymmetric functions

There is a deterministic terminating procedure which, given a natural unit interval graph GG on [n][n] and σ∈DG0\sigma \in D_G^0, returns a partition θG(σ)⊢n\theta_G(\sigma) \vdash n such that χG(X;q)=∑σ∈DG0qginv⁡G(σ)eθG(σ)(X)\chi_G(X; q) = \sum_{\sigma \in D_G^0} q^{\operatorname{ginv}_G(\sigma)} e_{\theta_G(\sigma)}(X) as a formal symmetric-function identity uniformly in nn and GG; in particular every elementary coefficient of χG(X;q)\chi_G(X; q) belongs to N[q]\mathbb{N}[q], proving the elementary-positivity part of the Shareshian–Wachs conjecture.

For every integer d≥0d \ge 0 and regular semisimple S∈Mn(C)S \in M_n(\mathbb{C}), under Tymoczko's dot action on ordinary cohomology of the Hessenberg variety Hess⁡(S,h)\operatorname{Hess}(S, h), there is an abstract C[Sn]\mathbb{C}[S_n]-module isomorphism H2d(Hess⁡(S,h);C)≅⨁λ⊢n(Mλ)⊕mλ,d(h)H^{2d}(\operatorname{Hess}(S, h); \mathbb{C}) \cong \bigoplus_{\lambda \vdash n} (M^\lambda)^{\oplus m_{\lambda, d}(h)}, where MλM^\lambda is the Young permutation module and mλ,d(h)=#{σ∈DG0:θG(σ)=λ,ginv⁡G(σ)=d}m_{\lambda, d}(h) = \#\{\sigma \in D_G^0 : \theta_G(\sigma) = \lambda, \operatorname{ginv}_G(\sigma) = d\}.

If α(Γ)≤D\alpha(\Gamma) \le D for a natural unit interval graph Γ\Gamma containing GG as an induced ordered subgraph on nn vertices with vertex-sum uu and M=∣E(G)∣M = |E(G)|, then XG(X;q)X_G(X; q) is symmetric and XG(X;v2)=∑λ⊢n,ℓ(λ)≤DvM[Xu]mλ(Y)eλ(X)X_G(X; v^2) = \sum_{\lambda \vdash n, \ell(\lambda) \le D} v^M [X_u] m_\lambda(Y) e_\lambda(X), independently of the extra vertices of Γ\Gamma.

An admissible product of elementary units in a completed quantum torus written in ray order (with Ω(pi,pj)>0\Omega(p_i, p_j) > 0 when the ray of pip_i precedes that of pjp_j) factors in the opposite ray order as an admissible product of elementary units with nonnegative integral multiplicities, and under effective computability hypotheses any prescribed coefficient and bounded part of the output list can be computed by finite rational linear algebra.

Every section Θm\Theta_m (and any section FF whose incoming coefficients belong to N((v−1))\mathbb{N}((v^{-1}))) has coefficients in N((v−1))\mathbb{N}((v^{-1})) in every chamber, and under a change of chart C→C′C \to C' for a simple root p∈Cp \in C, polynomial sections F=Ad⁡(Dp)F′F = \operatorname{Ad}(D_p) F' agree coefficientwise under the identity for h(p)>0h(p) > 0 and under SS for h(p)<0h(p) < 0.

In the all-negative chamber of the triangular chart, for every partition λ\lambda with at most DD parts (padded by zeroes to length DD), mλ(Y)=Θ∑i=1Dλidim_\lambda(Y) = \Theta_{\sum_{i=1}^D \lambda_i d_i}.

For every naturally labeled unit interval graph GG, the finite algorithm in Section 6.5 assigns a partition ΛG(w)⊢n\Lambda_G(w) \vdash n to each admissible word w∈AGw \in \mathcal{A}_G and satisfies the formal polynomial identity XG(X;q)=∑w∈AGqinv⁡G(w)eΛG(w)(X)X_G(X; q) = \sum_{w \in \mathcal{A}_G} q^{\operatorname{inv}_G(w)} e_{\Lambda_G(w)}(X).

Every naturally labeled unit interval graph on nn vertices occurs as an ordered induced subgraph on nn selected bridges of a triangular chart, with rational times and phases.

Methods

Centered quantum-torus graph-alphabet evaluation mapping elementary symmetric polynomials eke_k to commuting independent-set sums Ek(Γ)E_k(\Gamma) and reducing chromatic quasisymmetric function coefficients to [Xu]mλ(Y)[X_u]m_\lambda(Y).

Source excerpts

“Proposition 2.2 therefore defines an algebra homomorphism by ek ↦ Ek(Γ), with Ek = 0 for k > D. We denote its value on a symmetric polynomial F by F(Y), and write ek(Y) = Ek.” · Show in paper

“XG(X; v2) = ∑λ⊢n, ℓ(λ)≤D vM[Xu]mλ(Y ) eλ(X).” · Show in paper

Cohomological Hall / pack-symmetric shuffle algebra with slope-ordered destabilizing quotients, separated-center filtration, graded coproduct, and signed vector-space PBW decomposition for positive reordering of elementary units.

Source excerpts

“We first decompose shuffle spaces by slope and use separated-center restrictions to construct a coproduct on an auxiliary associated graded space. Polynomiality of the restriction symbols removes negative separation powers before evaluation at zero. A signed vector-space PBW decomposition and primitive strings then give the positive elementary factors.” · Show in paper

Scattering-diagram wall transport in a completed quantum torus with incoming coordinates An(F)=[Xn]F(V(n)+ϵ)A_n(F) = [X_n]F(V(n)+\epsilon) and chart mutation preserving actual coefficients of finite Laurent polynomial sections.

Source excerpts

“A section is a family of values transported by these consistent wall operations. Any value with the stipulated support in one generic chamber determines a section. Its incoming coefficient is An(F) = [Xn]F(V (n) + ϵ)” · Show in paper

Triangular chart embedding of natural unit interval graphs and repeated interval rotations to identify evaluated monomial symmetric functions with single positive theta sections.

Source excerpts

“A rotation moves the globally first bridge b, on level i, to the last phase and replaces its vector by b′ = b + δi, δi = di+1 − di, p = b − di.” · Show in paper

Local packet switching, common wall-history trees, and Garsia–Milne-style finite alternating-path cancellation to refine required-mask bijections to exact-mask bijections.

Source excerpts

“We convert the required-mask bijections to exact-mask bijections by finite bijective cancellation, in the spirit of the Garsia–Milne involution principle [16]. The complete alternating-path argument below also supplies termination in both directions.” · Show in paper