Papers
Topics
Authors
Recent
Search
2000 character limit reached

Double Stanley Symmetric Functions

Updated 20 December 2025
  • Double Stanley symmetric functions are a two-parameter generalization that unifies type A and type C Stanley functions via a bivariate combinatorial framework.
  • They employ a bicrystal structure with primed-tableau insertion methods to encode reduced signed increasing factorizations, extending classical Schubert calculus techniques.
  • Their Schur function expansions reveal rich algebraic properties and motivate new enumeration problems and conjectures related to unknotted signed permutations.

Double Stanley symmetric functions are a two-parameter generalization that interpolates between the type AA and type CC Stanley symmetric functions via a bivariate combinatorial framework. Defined over two separate alphabets, these functions unify the classical Schubert calculus approaches for types AnA_n and Cn+1C_{n+1} by encoding the combinatorics of reduced signed increasing factorizations in a single generating series. Specializing to one or the other alphabet recovers the respective Stanley symmetric functions, while the mixed setting introduces novel representation-theoretic and crystal structures with deep algebraic consequences (Hawkes, 2018).

1. Stanley Symmetric Functions of Types A and C

Let kk be a positive integer, and consider two alphabets x=(x1,,xk)x=(x_1,\dotsc,x_k) and y=(y1,,yk)y=(y_1,\dotsc,y_k), with the infinite-variable limits denoted by x\mathbf{x} and y\mathbf{y}. Classical Stanley symmetric functions arise from enumerating certain reduced factorizations of permutations:

  • Type A: For ωAn\omega\in A_n, a reduced increasing factorization into CC0 parts is a reduced word split into CC1 strictly increasing blocks. For CC2 with weights CC3, the degree-CC4 Stanley polynomial is

CC5

Taking CC6 yields CC7.

  • Type C: For CC8, unimodal reduced factorizations (blocks first decreasing, then increasing) are considered. The degree-CC9 polynomial is

AnA_n0

where AnA_n1 is the count of nonempty factors. The infinite-variable version is AnA_n2 (Hawkes, 2018).

2. Definition and Combinatorics of Double Stanley Symmetric Functions

The double Stanley symmetric function arises by simultaneously allowing positive and negative indices in the underlying generators AnA_n3 (with AnA_n4 as group elements). For AnA_n5, a reduced signed increasing factorization into AnA_n6 parts is a reduced word with each block increasing under the total order AnA_n7.

For AnA_n8, the double weight is a pair AnA_n9 where Cn+1C_{n+1}0 and Cn+1C_{n+1}1 count the negative and nonnegative indices in block Cn+1C_{n+1}2, respectively. The double Stanley polynomial is

Cn+1C_{n+1}3

and in the infinite-variable limit, Cn+1C_{n+1}4.

Specializations include:

Specialization Output
Cn+1C_{n+1}5 Cn+1C_{n+1}6
Cn+1C_{n+1}7 Cn+1C_{n+1}8

Symmetry in the variables Cn+1C_{n+1}9 corresponds to the map kk0 at the combinatorial level (Hawkes, 2018).

3. Bicrystal Structure and Tableaux Model

A principal insight is the identification of a bicrystal structure of type kk1 on double Stanley symmetric functions, extending known constructions for the type kk2 and kk3 cases.

  • Tableaux model: For kk4, a “primed‐recording” variant of Edelman–Greene insertion constructs a bijection

kk5

where kk6 is an unsigned Edelman–Greene tableau and kk7 is a primed tableau of the same shape, filled with marked and unmarked entries and satisfying weak monotonicity and column/row uniqueness conditions for markers.

The generating function over such tableau pairs recovers the double Stanley function:

kk8

  • Crystal operators: The kk9 crystal and its dual are implemented via operators x=(x1,,xk)x=(x_1,\dotsc,x_k)0, x=(x1,,xk)x=(x_1,\dotsc,x_k)1, x=(x1,,xk)x=(x_1,\dotsc,x_k)2, x=(x1,,xk)x=(x_1,\dotsc,x_k)3, which act on specific subwords of a primed tableau according to local rewriting rules. These operators are mutual inverses on their respective sides and satisfy crystal axioms, such as

x=(x1,,xk)x=(x_1,\dotsc,x_k)4

and commutation relations x=(x1,,xk)x=(x_1,\dotsc,x_k)5 for all x=(x1,,xk)x=(x_1,\dotsc,x_k)6.

  • Haiman insertion and isomorphism: Mixed (unshifted) Haiman insertion on words in the primed alphabet provides a bicrystal isomorphism from the tensor-product word crystal to the primed-tableau crystal, intertwining with the Edelman–Greene insertion and thus lifting to x=(x1,,xk)x=(x_1,\dotsc,x_k)7 (Hawkes, 2018).

4. Algebraic Properties and Schur Function Expansions

The algebraic structure of double Stanley symmetric functions is characterized by Schur expansions over two alphabets and admits a plethystic interpretation.

  • Schur expansion:

x=(x1,,xk)x=(x_1,\dotsc,x_k)8

where x=(x1,,xk)x=(x_1,\dotsc,x_k)9 is the set of highest-weight primed tableaux of shape y=(y1,,yk)y=(y_1,\dotsc,y_k)0 with both Yamanouchi property and its transpose+shift version.

  • Plethystic Schur function relation: For y=(y1,,yk)y=(y_1,\dotsc,y_k)1, the classical involution y=(y1,,yk)y=(y_1,\dotsc,y_k)2 on y=(y1,,yk)y=(y_1,\dotsc,y_k)3 yields

y=(y1,,yk)y=(y_1,\dotsc,y_k)4

There is a bijection between primed tableaux and signed tableaux, giving

y=(y1,,yk)y=(y_1,\dotsc,y_k)5

so for y=(y1,,yk)y=(y_1,\dotsc,y_k)6

y=(y1,,yk)y=(y_1,\dotsc,y_k)7

In particular,

y=(y1,,yk)y=(y_1,\dotsc,y_k)8

This recovers the relationships known in the literature (Lam ’95) (Hawkes, 2018).

5. Conjectures and Type C Generalizations

For general y=(y1,,yk)y=(y_1,\dotsc,y_k)9, x\mathbf{x}0 need not be symmetric. Several conjectures address expansions and special cases for the so-called unknotted signed permutations:

  • Conjecture 4.1: For unknotted x\mathbf{x}1, the specialization

x\mathbf{x}2

holds, where x\mathbf{x}3 counts signed Edelman–Greene tableaux of shape x\mathbf{x}4.

  • Conjecture 4.2: If x\mathbf{x}5 is unknotted and every reduced word contains at most one x\mathbf{x}6,

x\mathbf{x}7

with x\mathbf{x}8 denoting the count of tableaux with exactly x\mathbf{x}9 barred entries.

  • Conjecture 4.3: For y\mathbf{y}0, for any y\mathbf{y}1,

y\mathbf{y}2

These conjectures suggest a rich interplay between the double Stanley functions and Schur expansions depending on subtle properties of signed permutations (Hawkes, 2018).

6. Worked Examples

Double Stanley symmetric functions encode nontrivial combinatorics even for small permutations. For instance:

  • Example 1 (y\mathbf{y}3, one-line y\mathbf{y}4):

y\mathbf{y}5

The expansion simultaneously recovers the type y\mathbf{y}6 and y\mathbf{y}7 cases in the specializations y\mathbf{y}8 and y\mathbf{y}9.

  • Example 2 (ωAn\omega\in A_n0, one-line ωAn\omega\in A_n1):

ωAn\omega\in A_n2

These explicit expansions demonstrate the full interplay of the two alphabets and generalize classical Schur function formulas (Hawkes, 2018).

7. Context and Significance

Double Stanley symmetric functions provide a unifying framework for the algebraic and combinatorial structures underlying types ωAn\omega\in A_n3 and ωAn\omega\in A_n4 Schubert calculus. Their bicrystal structure exposes new symmetry and representation-theoretic phenomena, and the Schur-in-two-alphabets expansions bridge plethystic and classical symmetric function theory. The conjectured relationships for unknotted signed permutations motivate new enumeration problems for signed Edelman–Greene tableaux and further generalizations in type ωAn\omega\in A_n5. This suggests ongoing connections to crystal theory, symmetric functions in noncommutative variables, and generalized Schubert calculus (Hawkes, 2018).

Definition Search Book Streamline Icon: https://streamlinehq.com
References (1)

Topic to Video (Beta)

No one has generated a video about this topic yet.

Whiteboard

No one has generated a whiteboard explanation for this topic yet.

Follow Topic

Get notified by email when new papers are published related to Double Stanley Symmetric Functions.