Tableaux Skew Schubert Polynomials
- Tableaux skew Schubert polynomials are generating functions defined using tableau and inversion diagram models that encode skew elements of Weyl groups.
- They offer positive combinatorial expansions connecting double Schubert formulas with excited diagrams, standard Young tableaux, and classical symmetric functions.
- Recent developments extend Grassmannian cases to non-symmetric settings by employing inversion tableaux that capture Schubert structure constants.
Searching arXiv for the cited papers and directly related context. arxiv_search query: (Morales et al., 2017) Hook formulas for skew shapes III multivariate and product formulas arxiv_search query: (Tamvakis, 2020) Tableau formulas for skew Schubert polynomials arxiv_search query: (Axelrod-Freed, 15 Jul 2025) Inversions Tableaux Tableaux skew Schubert polynomials form a combinatorial framework in which Schubert polynomials attached to skew data are realized as generating functions over tableaux or tableau-like fillings. In the classical Lie types, skew elements of Weyl groups determine skew Young diagrams or their -strict analogues, and the corresponding double Schubert polynomials admit positive expansions over bitableaux, tritableaux, and typed tritableaux (Tamvakis, 2020). Related type- product formulas arise when principal evaluations are expressed through excited diagrams and standard Young tableaux of skew shape (Morales et al., 2017). A distinct recent development defines tableaux-skew Schubert polynomials from skew inversion tableaux on staircase inversion diagrams, recovering skew Schur polynomials in the Grassmannian case while remaining generally non-symmetric (Axelrod-Freed, 15 Jul 2025).
1. Weyl-group indexing and skew diagrams
The basic input is a notion of a skew element in a Weyl group. In type , a permutation is called skew if there exist and -Grassmannian permutations and , corresponding to partitions of length 0, such that 1 is a reduced factorization. The associated skew Young diagram is then 2. Here 3-Grassmannian means that 4 has exactly one descent at position 5 (Tamvakis, 2020).
In type 6, one fixes 7. A signed permutation is 8-Grassmannian if 9 for all 0, and such elements correspond to 1-strict partitions, meaning that no part 2 can repeat. If 3 are 4-strict partitions and 5 is reduced, then 6 is a compatible pair, 7 is a 8-horizontal strip, and the resulting element is skew of type 9 (Tamvakis, 2020).
In type 0, the indexing data are typed 1-strict partitions, where the type is 2, 3, or 4 according to how many times the part 5 appears. Compatible factorizations in the even-signed Weyl group 6 define typed 7-horizontal strips 8 and hence skew elements of type 9 (Tamvakis, 2020).
The ambient polynomial objects are defined in nilCoxeter algebras. In type 0, the double Schubert polynomial 1 is obtained as a coefficient in the product of 2 and 3; in type 4, 5 inserts a central 6 factor; in type 7, 8 uses 9. Type 0 is obtained from type 1 by
2
where 3 is the number of negative entries of 4. All these families are stable under the natural inclusions 5, so they define formal power series in infinitely many 6 (Tamvakis, 2020).
These definitions organize skew Schubert theory around reduced factorizations rather than only around partitions. A plausible implication is that the skew diagram is not merely a shape parameter: it is a record of a factorization pattern in the Weyl group.
2. Tableau formulas in the classical types
Tamvakis gives tableau formulas for double skew Schubert polynomials in all four classical types. The proofs follow a common blueprint: expand the double Schubert polynomial in the nilCoxeter algebra, isolate factorizations into increasing and decreasing pieces together with a middle Stanley-type factor, and interpret the resulting reduced factorizations as fillings of the relevant skew diagram (Tamvakis, 2020).
For type 7, the tableaux are 8-bitableaux. Their entries lie in the ordered alphabet
9
with primed letters marked and unprimed letters unmarked. Rows and columns are weakly increasing; marked letters are strictly increasing down columns; unmarked letters are strictly increasing across rows; and row 0 satisfies an interval condition determined by 1, 2, and 3. If
4
then
5
where the sum is over all 6-bitableaux 7 of shape 8 (Tamvakis, 2020).
For type 9, the tableaux are 0-tritableaux. Their alphabet has single-primed 1-letters, unmarked middle 2-letters, and double-primed 3-letters. Each fixed letter fills a 4-horizontal strip; the single-primed letters encode 5-strips, the double-primed letters encode 6-strips, and the unmarked letters form a 7-tableau 8. With
9
the formula is
0
The middle factor is the type-1 Stanley function 2, expanded by a known type-3 tableau rule (Tamvakis, 2020).
For type 4, the tableaux are typed 5-tritableaux. Their alphabet enlarges the type-6 one by including unprimed and “7” letters to encode the middle 8-strips together with a type 9 or 0 choice. The fixed-letter condition is now that each letter occupies a typed 1-horizontal strip, with extremality conditions for certain marked letters. If
2
then
3
Type 4 inherits the same 5-tritableaux model up to the global factor 6 (Tamvakis, 2020).
| Type | Tableau model | Generating formula |
|---|---|---|
| 7 | 8-bitableaux | 9 |
| 00 | 01-tritableaux | 02 |
| 03 | typed 04-tritableaux | 05 |
The significance of these formulas is twofold. First, they provide positive tableau expansions for skew Schubert representatives in all classical types. Second, they place type 06 alongside the symplectic and orthogonal cases in a single nilCoxeter-algebraic framework.
3. Single specializations and Grassmannian limits
The single skew Schubert polynomials are obtained by setting 07: 08 In the tableau formulas, this removes the 09-contributions. In type 10 one recovers the single bitableaux rule of Billey–Jockusch–Stanley, while in types 11 and 12 one recovers the single tritableaux formulas first proved by Tamvakis (Tamvakis, 2020).
The Grassmannian cases recover the standard symmetric-function families. If 13 has length 14 and 15 is 16-Grassmannian in 17, then
18
the classical double Schur polynomial. In this specialization the type-19 skew tableau rule reduces to the flagged bitableaux formula associated with Littlewood and Wachs (Tamvakis, 2020).
If 20 is 21-strict and 22 is 23-Grassmannian in type 24, then
25
the Ikeda–Mihalcea–Naruse double theta polynomial. If 26 is typed 27-strict and 28 is 29-Grassmannian in type 30, then
31
the double eta polynomial of Tamvakis (Tamvakis, 2020).
These Grassmannian specializations identify tableau skew Schubert formulas as genuine extensions of familiar tableau rules for Schur, theta, and eta polynomials. This suggests that the skew theory interpolates between ordinary Schubert combinatorics and classical symmetric-function theory.
4. Excited diagrams, principal evaluations, and product formulas
A complementary type-32 theory connects skew Schubert polynomials to excited diagrams, hook formulas, and path enumerations. For a vexillary, equivalently 33-avoiding, permutation 34 of shape 35 and supershape 36, the Knutson–Miller–Yong formula gives
37
and Macdonald’s identity implies
38
Therefore, whenever the number of excited diagrams has a product formula, the principal evaluation of the Schubert polynomial has one as well (Morales et al., 2017).
For 39-avoiding permutations, the principal evaluation is explicitly related to standard Young tableaux of skew shape. If 40 is 41-avoiding of length 42 with reduced word 43 and corresponding skew shape 44, then Theorem 4.8 states
45
Thus product formulas for 46 immediately induce product formulas for principal Schubert evaluations (Morales et al., 2017).
The proof mechanism uses two multivariate sums over excited diagrams,
47
Lemma 3.3 identifies 48 with an evaluation of a factorial Schur function and hence shows symmetry in the 49-variables. Via Lindström–Gessel–Viennot, the sums become nonintersecting-path enumerators; the symmetry permits a boundary-path flip that yields the multivariate path identities of Theorems 3.6 and 3.7. After the specialization 50 and 51, one combines the Naruse hook-length formula with the MacMahon box formula to collapse the path sum to a closed product (Morales et al., 2017).
This branch of the subject is not a tableau rule in the direct semistandard sense, but it is closely allied. It replaces tableaux by excited diagrams and nonintersecting paths, while retaining skew-shape indexing and producing explicit product formulas for Schubert evaluations.
5. Inversion tableaux and tableaux-skew Schubert polynomials
A newer model defines Schubert polynomials directly on inversion diagrams. For 52, the inversion set is
53
viewed inside the staircase of matrix-indexed boxes 54. An inversion tableau of shape 55 fills the shaded boxes of 56 by positive integers subject to three rules: the Rectangle Rule or weak-balance condition (IT1), column-strictness (IT2), and the row-bound condition (IT3) requiring the first-diagonal box 57, when shaded, to carry an entry 58. If 59 is the number of entries equal to 60, then 61 and 62. The generating theorem is
63
This gives a tableau realization of ordinary Schubert polynomials that directly specializes to semistandard Young tableaux in the Grassmannian case (Axelrod-Freed, 15 Jul 2025).
If 64 in left weak Bruhat order, then 65, so one may form the skew inversion diagram 66. A skew inversion tableau of shape 67 fills exactly these boxes, with the boxes of 68 treated as empty, and satisfies the same three rules (IT1)–(IT3). The resulting tableaux-skew Schubert polynomial is
69
This definition is explicitly distinct from the skew-element construction in Weyl groups: the indexing object is now a skew staircase inversion diagram rather than a skew Young diagram 70 (Axelrod-Freed, 15 Jul 2025).
Several structural properties are established. The family is stable under adding fixed points at the beginning of 71 and 72; the stable limit, analogous to the Stanley symmetric-function limit, is obtained by dropping (IT3). If both 73 and 74 are 75-Grassmannian, then
76
and therefore
77
Outside the Grassmannian case, the polynomials are generally not symmetric in the 78-variables (Axelrod-Freed, 15 Jul 2025).
The positivity theory is modeled on Schubert structure constants. If
79
with 80, then equivalently
81
The lexicographically largest monomial of 82 is 83, with coefficient 84, and the lexicographically minimal monomial is described via the column-Lehmer code. For dominant permutations, where the Lehmer code is weakly decreasing, the polynomial collapses to a single monomial, and in the skew-dominant case there is a unique skew inversion tableau. The paper also states that no closed-form determinant or Pfaffian is known in general beyond the Schur-Grassmannian case (Axelrod-Freed, 15 Jul 2025).
6. Comparison, applications, and scope
The subject contains several related but non-identical notions of a skew Schubert polynomial. One usage refers to double Schubert polynomials indexed by skew elements of Weyl groups and expressed by tableau formulas on skew Young diagrams or their 85-strict analogues (Tamvakis, 2020). A second usage concerns principal evaluations of certain type-86 Schubert polynomials indexed by skew-shape data and controlled by excited diagrams, standard Young tableaux, and hook-type product formulas (Morales et al., 2017). A third defines the tableaux-skew Schubert polynomials 87 on skew inversion diagrams in the staircase (Axelrod-Freed, 15 Jul 2025).
These theories intersect most clearly in the Grassmannian regime. In type 88, Grassmannian skew data recover skew Schur polynomials, whether through flagged bitableaux on Young diagrams or through reverse semistandard tableaux arising from inversion tableaux (Tamvakis, 2020, Axelrod-Freed, 15 Jul 2025). Outside that regime, the distinctions become pronounced: the Weyl-group tableau formulas remain positive combinatorial expansions for double Schubert representatives, while 89 is generally non-symmetric and is designed to model Schubert structure constants directly (Axelrod-Freed, 15 Jul 2025).
The broader enumerative significance is reinforced by tiling models. The bijection between excited diagrams and lozenge tilings of a region with base 90 identifies
91
so factorial-Schur symmetry yields Jacobi–Trudi-type determinantal formulas for weighted tilings. In the boxed case 92, one obtains a determinantal formula for weighted plane partitions in an 93 box, and Theorem 6.6 gives a determinantal expression for the probability of any fixed nonintersecting path in a random hook-weighted tiling of the hexagon (Morales et al., 2017). This suggests that skew Schubert combinatorics sits at an interface among Schubert calculus, tableau theory, symmetric functions, and exactly solvable tiling models.
A common misconception is that “skew Schubert polynomial” denotes a single canonical polynomial family. The literature represented here does not support that identification. Instead, it exhibits multiple constructions, each tailored to a different combinatorial or geometric problem: Weyl-group skew elements and classical-type tableaux, excited-diagram evaluations and product formulas, and inversion-diagram skew polynomials with Schubert-positive expansions. Their overlap in the Grassmannian case is substantial, but their general domains and structural properties are not the same (Tamvakis, 2020, Morales et al., 2017, Axelrod-Freed, 15 Jul 2025).