TOPICS
Search

Schubert Polynomial


The Schubert polynomial S_w is the polynomial indexed by a permutation w and defined by the following divided difference recursion (Billey et al. 1993). For the reversing permutation w_0 in the symmetric group S_n, set

 S_(w_0)=product_(i=1)^nx_i^(n-i).
(1)

Let s_i interchange positions i and i+1, so that ws_i interchanges the entries of w at those positions. When w(i)<w(i+1),

 S_w=partial_iS_(ws_i),
(2)

where partial_if=(f-s_if)/(x_i-x_(i+1)) is the divided difference operator and s_if interchanges x_i and x_(i+1) in f. For example, in one-line notation, 132s_1=312 and 312s_2=321, so

 S_(132)=partial_1partial_2(x_1^2x_2)=partial_1(x_1^2)=x_1+x_2.
(3)

Appending a fixed point at the end of w leaves S_w unchanged. The polynomials indexed by all finite permutations, identifying indices that differ only by such appended fixed points, form an integer basis of Z[x_1,x_2,...]. The polynomial degree of S_w equals the inversion number of w. If w has exactly one permutation descent, at position k, then S_w is a Schur polynomial in x_1,...,x_k (Billey et al. 1993, Knutson and Zinn-Justin 2026).

The product S_uS_v expands in this basis with nonnegative integer coefficients. For u and v with nonempty descent sets D(u) and D(v), respectively, their overlap is the set of positions in D(u) union D(v) from minD(u) through maxD(v), inclusive. The overlap is empty when the lower endpoint exceeds the upper endpoint. Knutson and Zinn-Justin (2026) express the product coefficients as counts of labeled triangular tilings (Schubert puzzles) using separate rules for overlaps of size at most one (separated descents) and at most two (almost separated descents). The factors may be interchanged before testing the overlap condition. The two rules use different tile sets, with boundary labels encoding the two input permutations and the index of the output Schubert polynomial.


See also

Divided Difference, Permutation Descent, Schubert Variety, Schur Polynomial

Explore with Wolfram|Alpha

References

Billey, S. C.; Jockusch, W.; and Stanley, R. P. "Some Combinatorial Properties of Schubert Polynomials." J. Alg. Combin. 2, 345-374, 1993. https://doi.org/10.1023/A:1022419800503.Knutson, A. and Zinn-Justin, P. "Schubert Puzzles and Integrability III: Separated Descents." Elec. J. Combin. 33, P4.39, 2026. https://doi.org/10.37236/14581.

Cite this as:

Weisstein, Eric W. "Schubert Polynomial." From MathWorld--A Wolfram Resource. https://mathworld.wolfram.com/SchubertPolynomial.html

Subject classifications