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

Combinatorial invariance of Kazhdan–Lusztig polynomials

If ι:[u,b]→[u′,b′]\iota : [u, b] \to [u', b'] is an isomorphism of abstract Bruhat interval posets in arbitrary Coxeter systems (W,S)(W, S) and (W′,S′)(W', S'), then their equal-parameter Kazhdan–Lusztig polynomials satisfy Pu,bW(q)=Pu′,b′W′(q)P^W_{u,b}(q) = P^{W'}_{u',b'}(q).

For a finite-rank Coxeter system (W,S)(W, S), there is a finite-dimensional real vector space VV with a nondegenerate symmetric bilinear form that is reflection faithful, has linearly independent simple roots and coroots, and admits a strictly dominant linear form ρ\rho satisfying (wρ)(αs)>0  ⟺  sw>w(w\rho)(\alpha_s) > 0 \iff sw > w.

An isomorphism ι:[u,b]→[u′,b′]\iota : [u, b] \to [u', b'] of Bruhat intervals in arbitrary Coxeter systems preserves their directed Bruhat graphs.

If D=DΠD = D_\Pi is a maximal root-plane subgroup of WW and x,c∈[u,b]x, c \in [u, b] lie in a common coset of DD with x≤Dcx \le_D c and ℓD(c)−ℓD(x)≥2\ell_D(c) - \ell_D(x) \ge 2, then there is a maximal dihedral plane subgroup D′D' of W′W' such that ι([x,c]D)=[ι(x),ι(c)]D′\iota([x, c]_D) = [\iota(x), \iota(c)]_{D'}, preserving and reflecting relative order, relative rank differences, and directed relative reflection edges.

For an edge e:x→ye : x \to y in [u,b][u, b] whose reflection label lies in a maximal dihedral plane subgroup DD, and for c∈[u,b]c \in [u, b] with y≤Dcy \le_D c, the numbers hx,hyh_x, h_y of outgoing arrows from x,yx, y in [x,c]D[x, c]_D with scheduled labels strictly later than ee satisfy hx−hy=kD(e)=(ℓD(y)−ℓD(x)−1)/2h_x - h_y = k_D(e) = (\ell_D(y) - \ell_D(x) - 1)/2.

For each coset CC of a maximal dihedral plane subgroup DD with K=C∩[1,b]≠∅K = C \cap [1, b] \neq \emptyset, the localized moment-graph sheaf BR∣KB_R|_K decomposes as an ungraded sheaf over R=ApR = A_{\mathfrak{p}} into a direct sum of dihedral structure sheaves ⨁c∈KOc,R⊕mc\bigoplus_{c \in K} \mathcal{O}_{c,R}^{\oplus m_c}.

For an edge e:x→ye : x \to y with strictly later upward edge sets F⊂UxF \subset U_x and G⊂UyG \subset U_y in the transported schedule, if Ly(G)L_y(G) is graded free over AA, then there is a nonzero homogeneous fe∈C=A/(αe)f_e \in C = A/(\alpha_e) of degree (d(x,y)−1)/2(d(x,y)-1)/2 such that Ie⊆feJeI_e \subseteq f_e J_e inside BeB^e, where feJef_e J_e is graded free over CC.

Every poset isomorphism ι:[u,b]→[u′,b′]\iota : [u, b] \to [u', b'] preserves all Kazhdan–Lusztig polynomials Px,y(q)=Pι(x),ι(y)′(q)P_{x,y}(q) = P'_{\iota(x),\iota(y)}(q) on subintervals u≤x≤y≤bu \le x \le y \le b, as well as all corresponding RR-polynomials.

Methods

Reduction of Kazhdan–Lusztig and R-polynomials on an interval [u, b] in an arbitrary Coxeter system to a finite-rank standard parabolic subgroup W_J.

Source excerpts

“Let J be the finite set of simple reflections occurring in a reduced expression for b. Every element below b lies in the standard parabolic subgroup WJ , by the subword criterion for Bruhat order [4, Theorem 2.2.2]. ... Consequently we may, and do, assume that both Coxeter systems have finite rank.” · Show in paper

Construction of a minimal-dimension reflection-faithful real realization V = V_1 \oplus K \oplus K' by adjoining a dual space K' to the radical K of the Tits form.

Source excerpts

“Start with the usual geometric root space V0 and its symmetric Tits form [4, Sections 4.2–4.4]. Let K be its radical and choose a complement V1 to K. Adjoin a vector space K′ dual to K, pair K and K′ nondegenerately, and take K′ to be isotropic and orthogonal to V1. The resulting form on V = V1 ⊕ K ⊕ K′ is nondegenerate and extends the original form.” · Show in paper

Construction of geometric reflection orders on positive roots using ratios f(\alpha)/h(\alpha) of linear functionals.

Source excerpts

“Choose a linear functional h strictly positive on the simple roots, and therefore on every positive root. Choose another linear functional f such that the numbers f(α)/h(α), α ∈ Φ+, are pairwise distinct, and order the roots by these numbers.” · Show in paper

Closure rule on four-layer configurations {a} | {p,q} | {r,s} | {c} to reconstruct directed Bruhat graphs from abstract Bruhat interval posets.

Source excerpts

“For a finite Bruhat interval Q, let EQ be the least relation containing its cover pairs and closed under the following rule. Arrange six distinct vertices in four layers {a} | {p, q} | {r, s} | {c}. If all eight ordered pairs from one layer to the next are in EQ, add (a, c). This rule depends only on the poset.” · Show in paper

Localization of the moment-graph sheaf at a root-plane prime ideal \mathfrak{p} \subset A and descending induction to decompose into dihedral structure sheaves.

Source excerpts

“Let p ⊂ A be the prime ideal generated by the plane Π, and put R = Ap, m = pR, BR = B ⊗A R.” · Show in paper

“We construct an isomorphism in descending relative order. Suppose the sheaf has already been identified above a vertex a with a sum of the models in the statement.” · Show in paper

Simultaneous induction on interval rank combining edge-image Hilbert series bounds, Dyer's reflection-order path formula, and Kazhdan–Lusztig reciprocity.

Source excerpts

“We prove Theorem 1.1 together with the following statement: For every interval isomorphism and every transported schedule, the modules Lu(F) are graded free over A for all terminal portions F of the upward edges at the bottom vertex u. ... Induct on d(u, b).” · Show in paper