The Schubert polynomial is the polynomial indexed
by a permutation
and defined by the following divided difference recursion
(Billey et al. 1993). For the reversing permutation
in the symmetric
group
, set
|
(1)
|
Let
interchange positions
and
, so that
interchanges the entries of
at those positions. When
,
|
(2)
|
where
is the divided difference operator and
interchanges
and
in
. For example, in one-line notation,
and
, so
|
(3)
|
Appending a fixed point at the end of leaves
unchanged. The polynomials indexed by all finite permutations,
identifying indices that differ only by such appended fixed points, form an integer
basis of
. The polynomial
degree of
equals the inversion number of
. If
has exactly one permutation
descent, at position
, then
is a Schur polynomial
in
(Billey et al. 1993, Knutson and Zinn-Justin 2026).
The product
expands in this basis with nonnegative integer coefficients.
For
and
with nonempty descent sets
and
, respectively, their overlap
is the set of positions in
from
through
, 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.