#Key polynomials

The key polynomials, also known as Demazure characters, form a family of nonsymmetric polynomials, indexed by weak compositions, or alternatively, by an integer partition and a permutation. The set \(\{ \key_\alpha(x_1,\dotsc,x_n) \}_\alpha,\) where \(\alpha\) ranges over all weak compositions of length \(n,\) is a basis for \(\setC[x_1,\dotsc,x_n].\)

The key polynomials generalize the Schur polynomials.

Demazure characters were introduced in [Dem74, Dem74]. Geometrically, they are characters of Demazure modules associated with Schubert varieties in the flag variety; see varieties in algebraic combinatorics. Later, a combinatorial formula using so-called key tableaux was discovered in [LS90]. Key polynomials are also given as a specialization of nonsymmetric Macdonald polynomials; see [HHL08]. This gives several combinatorial models for the key polynomials; see the work of S. Mason [Mas09], and also [Kur16, AS19]. Another positive model is given by Kohnert tableaux, which label the Kohnert diagrams for the key diagram. The same Kohnert-tableau framework gives positive expansions into the quasi-key basis and into the fundamental slide basis [AS18].

Y. Xiao, R. Xiong, and H. Zhang introduce hybrid pipe dreams for key polynomials: a family of tile models linked by explicit local weight-preserving bijections, with a two-sided branching rule as an application [XXZ26]. Their construction is modeled on the hybrid approach for Schubert polynomials and complements the classical pipe-dream formula for Schubert polynomials.

Mrigendra Singh Kushwaha, K. N. Raghavan, and S. Viswanath give simple procedures for computing the left and right keys of a semistandard Young tableau [KRV23]. Their procedures repeatedly apply Deodhar lifts, which recover the final and initial directions of the corresponding Littelmann paths.

L. Lapointe and L. Pena give a non-algorithmic characterization particularly well adapted to RSK [LP26].

Theorem (Right keys from decreasing words).

The right key of a tableau is determined by the suprema, in the appropriate order on decreasing words, of the decreasing subwords of its reading word. These suprema are invariant under elementary Knuth moves.

This makes the right key visibly compatible with Knuth equivalence and the RSK correspondence. Lapointe and Pena use it to construct a tableau generating function for the \(m\)-symmetric Schur functions at \(t=0\), identify the dual family with key polynomials, and prove the corresponding Cauchy identity. Their specialization also gives an ordinary-RSK proof of A. Lascoux’s nonsymmetric Cauchy identity for Demazure characters and atoms.

Key polynomials are closely related to Demazure atoms.

The \(K\)-theoretic versions of key polynomials are the Lascoux polynomials.

#Almost symmetric Schur functions

M. B. Weising introduces the almost symmetric Schur functions \(s_{(\mu|\lambda)}\) [Wei24]. They are the \(q=t=0\) specialization of stable-limit nonsymmetric Macdonald functions and simultaneously generalize finite-variable key polynomials and ordinary Schur functions. The paper gives recurrence definitions using isobaric divided differences and Weyl symmetrization operators, a tableau formula, and positive expansions in the monomial and monomial-Schur bases for almost symmetric functions.

#Definition (Operators)

Define the divided difference operator \(\partial_i\) as \[\partial_i(f) = \frac{f - s_i(f)}{z_i - z_{i+1}},\] and let the isobaric divided difference operator be \(\pi_i(f) \coloneqq \partial_i(z_i f)\) for \(i=1,\dotsc,n-1\) whenever \(f \in \setC[z_1,\dotsc,z_n].\) The operators satisfy \(\pi_i^2 = \pi_i\) and the braid relations.

Let \(\sigma = s_{i_1} s_{i_2} \dotsc s_{i_\ell}\) be a reduced word of a permutation \(\sigma \in \symS_n,\) and let \[\pi_\sigma \coloneqq \pi_{i_1} \circ \pi_{i_2} \circ \dotsb \circ \pi_{i_\ell}.\] This is well-defined, as the action of \(\pi_\sigma\) is independent of the choice of reduced word.

Let \(\lambda\) be a partition with at most \(n\) parts, and let \(\sigma \in \symS_n.\) In fact, we can choose \(\sigma\) to be the minimal coset representation for the parabolic subgroup \(W_J \subseteq \symS_n\) that fixes \(\lambda.\) The key polynomial \(\key_{\lambda,\sigma}(z)\) is defined as \[\key_{\lambda,\sigma}(z) \coloneqq \pi_\sigma\left( z_1^{\lambda_1} \dotsm z_n^{\lambda_n} \right).\] Note that if \(\sigma^1(\lambda)=\sigma^2(\lambda),\) then \(\key_{\lambda,\sigma^1}(z) = \key_{\lambda,\sigma^2}(z).\)

This definition shows the close connection between Schubert polynomials and key polynomials. If \(w_0\) is the longest permutation in \(\symS_n,\) then \[\schurS_\lambda(z_1,\dotsc,z_n) = \key_{\lambda,w_0}(z_1,\dotsc,z_n),\] so key polynomials generalize the Schur polynomials.

Example (From [AA19]).

Let \(\lambda = (2,1,0,0)\) and \(\sigma = [2,4,3,1] \in \symS_4\) in one-line notation. The permutation can be expressed as a reduced word as \(\sigma = s_2 s_3 s_2 s_1.\) We compute the key polynomial as follows: \[\begin{aligned} \key_{\lambda,\sigma}(z) &= \pi_2 \pi_3 \pi_2 \pi_1 (z_1^2 z_2) = \pi_2 \pi_3 \pi_2 \partial_1 (z_1^3 z_2 ) = \pi_2 \pi_3 \pi_2 \left( \frac{z_1^3z_2 - z_1 z^3_2}{z_1-z_2}\right) \\ &= \pi_2 \pi_3 \pi_2 (z_1^2z_2 + z_1 z_2^2). \end{aligned}\] We continue the calculation by applying \(\pi_2\) and get \[\begin{aligned} \key_{\lambda,\sigma}(z) &= \pi_2 \pi_3 (z_2 z_1^2+z_3 z_1^2+z_2^2 z_1+z_3^2 z_1+z_2 z_3 z_1). \end{aligned}\] Applying \(\pi_2 \pi_3\) then finally gives \[\begin{split} \key_{\lambda,\sigma}(z) &= z_1^2 z_2 + z_1^2 z_3 + z_1^2 z_4 + z_1 z_2^2 + z_1 z_3^2 \\ &\phantom{=}+ z_1 z_4^2 + z_1 z_2 z_3 + z_1 z_2 z_4 + z_1 z_3 z_4 . \end{split}\] In general, some monomials may appear multiple times.

Alternatively, key polynomials are also commonly indexed by weak compositions. If \(\alpha = (\alpha_1,\dotsc,\alpha_n)\) is a weak composition, we let \(\key_{\alpha}(z)\) be the key polynomial \(\key_{\lambda,\sigma}(z),\) where \(\lambda\) is the partition obtained from \(\alpha\) by sorting the elements in decreasing order, and \(\sigma \in \symS_n\) is a permutation such that it sorts \(\alpha\) into a partition; \(\lambda = (\alpha_{\sigma(1)},\alpha_{\sigma(2)},\dotsc,\alpha_{\sigma(n)}).\)

For example, \(\alpha = (1,0,3,2)\) corresponds to \(\lambda = (3,2,1,0)\) and \(\sigma = [3, 4, 1, 2].\) With these conventions, \(\key_{\lambda}(z)=\schurS_{\lambda}(z).\)

Note: This indexing convention is not uniform in the literature; in some places, one needs to reverse the indexing composition \(\alpha.\)

#Kogan faces and key polynomials via GT-polytopes

A formula for the key polynomials as a sum over lattice points in a union of faces of Gelfand–Tsetlin polytopes was proved in [KST12]. This subsection describes the construction in detail, following [KST12] and [Kog00].

Recall that the GT-polytope \(\GT(\lambda)\) is defined by the interlacing inequalities \(x_{i+1,j} \geq x_{i,j} \geq x_{i+1,j+1}\) together with the boundary condition \(x_{n,j} = \lambda_j.\) Its integer points are in bijection with semistandard Young tableaux of shape \(\lambda.\) The weight of a GT-pattern \(G\) is \(w(G) = (w_1, \dotsc, w_n)\) where \(w_k = \sum_j x_{k,j} - \sum_j x_{k-1,j}\) (row sum differences, with \(\sum_j x_{0,j} = 0\)).

Definition (Kogan face).

A Kogan face of \(\GT(\lambda)\) is obtained by forcing a subset of the left-interlacing inequalities to equalities: \(x_{i+1,j} = x_{i,j}\) for some collection of pairs \((i,j)\) with \(1 \leq j \leq i \lt n.\) To each equality \(x_{i+1,j} = x_{i,j},\) we associate the simple transposition \(s_{n-i+j-1}.\)

Example (Equalities and transpositions in a GT-pattern).

For \(n = 4,\) the six left-interlacing positions and their transpositions (\(s_{4-i+j-1} = s_{3-i+j}\)) are:

Left-interlacing inequalities in a GT-pattern for $n=4,$ with transposition labels.

The blue arrows show the left-interlacing inequalities \(x_{i+1,j} \geq x_{i,j},\) labeled with the transposition \(s_{n-i+j-1}\) that is activated when the inequality is forced to equality.

Definition (Reduced Kogan face and type).

Given a Kogan face, we read the associated transpositions row by row from bottom to top. Within each row, we read from left to right. If the resulting word \(s_{a_1} s_{a_2} \dotsm s_{a_\ell}\) is a reduced word, the Kogan face is called reduced. Its type is the permutation \(\sigma = s_{a_1} s_{a_2} \dotsm s_{a_\ell} \in \symS_n.\)

Remark

The same permutation may arise as the type of several different reduced Kogan faces, since a permutation may have multiple reduced words.

Example (Worked example: \(n = 3,\) \(\lambda=210\)).

For \(n = 3,\) the GT-pattern has three left-interlacing positions, which we refer to as \(L_1,\) \(L_2,\) and \(L_3\) in reading order:

Left-interlacing inequalities in a GT-pattern for $n=3,$ with transposition labels.

For \(\lambda = 210,\) the free variables satisfy \(2 \geq a \geq 1,\) \(1 \geq b \geq 0,\) \(a \geq b,\) \(a \geq c \geq b.\)

The eight integer GT-patterns, their monomials, and the Kogan faces they belong to are:

$a$ $b$ $c$ Monomial Faces Active equalities $1$ $0$ $0$ $z_2 z_3^2$ - (none) $1$ $0$ $1$ $z_1 z_3^2$ $L_3$ $c = a$ $1$ $1$ $1$ $z_1 z_2 z_3$ $L_2, L_3$ $b = 1,$ $c = a$ $2$ $0$ $0$ $z_2^2 z_3$ $L_1$ $a = 2$ $2$ $0$ $1$ $z_1 z_2 z_3$ $L_1$ $a = 2$ $2$ $0$ $2$ $z_1^2 z_3$ $L_1, L_3$ $a = 2,$ $c = a$ $2$ $1$ $1$ $z_1 z_2^2$ $L_1, L_2$ $a = 2,$ $b = 1$ $2$ $1$ $2$ $z_1^2 z_2$ $L_1, L_2, L_3$ all

The reduced Kogan faces and their types:

Equalities Word (reading order) Reduced? Type (none) $\varepsilon$ yes $\id = [1,2,3]$ $L_1$ $s_1$ yes $s_1 = [2,1,3]$ $L_2$ $s_2$ yes $s_2 = [1,3,2]$ $L_3$ $s_2$ yes $s_2 = [1,3,2]$ $L_1$ , $L_2$ $s_1 s_2$ yes $s_1 s_2 = [2,3,1]$ $L_1$ , $L_3$ $s_2 s_1$ yes $s_2 s_1 = [3,1,2]$ $L_2$ , $L_3$ $s_2 s_2$ no - $L_1$ , $L_2$ , $L_3$ $s_2 s_1 s_2$ yes $w_0 = [3,2,1]$

Note that \(s_2\) appears as the type of two different faces (\(L_2\) and \(L_3\)).

#Key polynomials from Kogan faces

The key polynomial \(\key_{\lambda,\sigma}\) is indexed by a partition \(\lambda\) and a permutation \(\sigma \in \symS_n.\) The connection to Kogan faces uses the product \(w_0 \sigma,\) where we use function composition: \((w_0 \sigma)(i) = w_0(\sigma(i))\); that is, \(\sigma\) acts first.

Theorem (Kiritchenko–Smirnov–Timorin [KST12, Thm. 2.2]).

Define \[\GT(\lambda, \sigma) \coloneqq \bigcup_{\substack{\mathcal{F} \subseteq \GT(\lambda) \\ \mathcal{F} \text{ reduced Kogan face} \\ \type(\mathcal{F}) = w_0 \sigma}} \mathcal{F}.\] Then \[\key_{\lambda,\sigma}(\mathbf{z}) = \sum_{G \in \GT(\lambda,\sigma) \cap \setZ^{n(n-1)/2}} z_1^{w_1(G)} \dotsm z_n^{w_n(G)}.\]

Example (Continuing the previous example).

Continuing with \(n = 3,\) \(\lambda = 210\):

  • \(\sigma = \id = [1,2,3]\): \(w_0 \sigma = w_0 = [3,2,1].\) Unique face of type \(w_0\): \(\{L_1, L_2, L_3\}.\) One pattern: \((a,b,c) = (2,1,2)\) giving \(z_1^2 z_2.\) So \(\key_{\lambda, \id} = z_1^2 z_2.\)

  • \(\sigma = s_1 = [2,1,3]\): \(w_0 \sigma = [2,3,1] = s_1 s_2.\) Unique face of type \(s_1 s_2\): \(\{L_1, L_2\}.\) Patterns: \(a=2, b=1,\) \(c \in \{1,2\}\) giving \(z_1 z_2^2 + z_1^2 z_2.\) So \(\key_{\lambda, s_1} = z_1^2 z_2 + z_1 z_2^2.\)

  • \(\sigma = s_2 = [1,3,2]\): \(w_0 \sigma = [3,1,2] = s_2 s_1.\) Unique face of type \(s_2 s_1\): \(\{L_1, L_3\}.\) Patterns: \(a=2, c=2,\) \(b \in \{0,1\}\) giving \(z_1^2 z_3 + z_1^2 z_2.\) So \(\key_{\lambda, s_2} = z_1^2 z_2 + z_1^2 z_3.\)

  • \(\sigma = w_0 = [3,2,1]\): \(w_0 \sigma = \id.\) The full GT-polytope (type \(\id,\) no equalities). All 8 patterns. \(\key_{\lambda, w_0} = \schurS_{(2,1)}(z_1, z_2, z_3).\)

All four results match the operator definition \(\key_{\lambda,\sigma} = \pi_\sigma(z_1^{\lambda_1} \dotsm z_n^{\lambda_n}).\)

Remark (Convention note).

We use function composition: the product \(\pi\sigma\) means \((\pi\sigma)(i) = \pi(\sigma(i)),\) so \(\sigma\) acts first. This is the same convention as matrix multiplication. Some references use the opposite convention where \(\pi\) acts first in \(\pi\sigma\); this interchanges key polynomials for \(\sigma\) and \(\sigma^{-1}\) (or equivalently, left and right keys in the tableaux model). Our convention matches the standard Demazure operator definition \(\key_{\lambda,\sigma} = \pi_\sigma(z^\lambda)\) when \(\pi_\sigma = \pi_{i_1} \circ \dotsb \circ \pi_{i_\ell}\) for a reduced word \(\sigma = s_{i_1} \dotsm s_{i_\ell}.\)

V. Kiritchenko constructs simple geometric mitosis operations on faces of Cayley sums of polytopes [Kir25]. These operations act as convex-geometric counterparts of divided difference operators and give a uniform construction of Knutson–Miller mitosis in type \(A\) and Fujita mitosis in type \(C\) on Kogan faces.

#Kempf permutations and flagged Schur polynomials

Proposition (Kogan [Kog00]).

If \(\sigma \in \symS_n\) avoids the permutation pattern \(132,\) then there is a unique reduced Kogan face of type \(w_0 \sigma.\) In this case \(\GT(\lambda, \sigma)\) is a single polytope face, and the key polynomial is a flagged Schur polynomial.

#Ehrhart polynomial

Fix \(\lambda,\) \(\sigma \in \symS_n.\) With the above theorem, it follows that the map \(k \mapsto \key_{k \lambda,\sigma}(1^n)\) is a polynomial in \(k.\) This is in fact an Ehrhart polynomial of a union of faces in a GT-polytope. Let \(P_{\sigma}(\lambda_1,\dotsc,\lambda_n;k)\) denote this polynomial. From the definition via divided difference operators, one can see that \(P_{\sigma}(\lambda_1,\dotsc,\lambda_n;k)\) is a polynomial in \(\setQ[\lambda_1,\dotsc,\lambda_n,k].\)

See [AA19] for the following conjecture.

Conjecture (Alexandersson–Alhajjar (2018)).

The polynomial \(P_{\sigma}(\lambda_1,\dotsc,\lambda_n;k)\) has nonnegative coefficients.

Moreover, after setting \(a_j = \lambda_1+\lambda_2+\dotsb+\lambda_j,\) the function \(P_{\sigma}(a_1,\dotsc,a_n;k)\) is a polynomial in \(\setQ[a_1,\dotsc,a_n,k]\) with nonnegative coefficients.

See also the related conjecture regarding the corresponding \(h^*\)-polynomial.

#Definition (Skyline fillings)

In [HHL08], the authors presented a combinatorial model for the nonsymmetric Macdonald polynomials. Setting \(q=t=0\) in the nonsymmetric Macdonald polynomial \(\macdonaldE_{\alpha}(\xvec,q,t)\) recovers the key polynomial \(\key_\alpha(\xvec).\)

From the work of S. Mason [Mas09], we in fact get two combinatorial models for key polynomials as special cases of the permuted basement Macdonald polynomials. In the definition below, we assume that the reader is familiar with the combinatorial model for the permuted basement Macdonald polynomials.

Definition

A semistandard augmented filling of shape \(\alpha = (\alpha_1,\dotsc,\alpha_n)\) is a non-attacking filling of the diagram with shape \(\alpha,\) basement \(\sigma = [n,n-1,\dotsc,2,1]\) such that all rows (including the basement) are weakly decreasing, and there are no coinversion triples. Let \(\mathrm{SSAF}(\alpha)\) be the set of semistandard augmented fillings of shape \(\alpha.\)

The key polynomial \(\key_\alpha(\xvec)\) is defined as \[\key_\alpha(\xvec) = \sum_{T \in \mathrm{SSAF}(\alpha)} \xvec^T.\] When \(\alpha\) is a partition, we sum over fillings with weakly decreasing rows, and strictly decreasing columns. This sum is the Schur polynomial \(\schurS_{\lambda}(x_1,\dotsc,x_n).\)

Alternatively, by choosing a different basement, we can realize \(\key_\alpha(\xvec)\) as a sum over augmented fillings with partition shape. Let \(\mathrm{SSAF}_{\sigma}(\lambda)\) be the set of semistandard augmented fillings with basement \(\sigma\) and shape \(\lambda.\) Then \[\key_\alpha(\xvec) = \sum_{T \in \mathrm{SSAF}_{\sigma}(\lambda)} \xvec^T, \quad \text{where} \quad \alpha = (\lambda_{\sigma^{-1}(n)}, \lambda_{\sigma^{-1}(n-1)},\dotsc,\lambda_{\sigma^{-1}(1)}).\]

A series of bijections proves the equivalence of the two above formulas; see [AS19, Prop. 5.5] (with \(t=0\)). This amounts to proving that interchanging two adjacent rows (including the basement) in an augmented diagram in such a way that a longer row is moved upwards, preserves the weighted sum of SSAFs with corresponding shape and basement.

Example (A small SSAF computation).

Let \(\alpha=(1,0,2).\) In the English row convention used on the permuted-basement Macdonald page, the key fillings are displayed with shape \((2,0,1)\) and basement \((3,2,1).\) The vertical bar separates the basement from the ordinary cells. The five fillings are listed row by row, from top to bottom: \[\begin{aligned} F_1&:\ (3\mid 2,1),\ (2\mid \emptyset,\emptyset), (1\mid 1,\emptyset),\\ F_2&:\ (3\mid 2,2),\ (2\mid \emptyset,\emptyset), (1\mid 1,\emptyset),\\ F_3&:\ (3\mid 3,1),\ (2\mid \emptyset,\emptyset), (1\mid 1,\emptyset),\\ F_4&:\ (3\mid 3,2),\ (2\mid \emptyset,\emptyset), (1\mid 1,\emptyset),\\ F_5&:\ (3\mid 3,3),\ (2\mid \emptyset,\emptyset), (1\mid 1,\emptyset). \end{aligned}\] Their weights are \[\begin{array}{c|ccccc} F & F_1 & F_2 & F_3 & F_4 & F_5 \\ \hline \mathrm{wt}(F) & (2,1,0) & (1,2,0) & (2,0,1) & (1,1,1) & (1,0,2) \end{array}\] It follows that \[\key_{(1,0,2)}(x_1,x_2,x_3) = x_1^2x_2 + x_1x_2^2 + x_1^2x_3 + x_1x_2x_3 + x_1x_3^2.\] This agrees with the divided-difference definition of the same key polynomial.

Example (The same key from right keys).

For \(\alpha=(1,0,2),\) the key tableau \(\mathrm{key}(\alpha)\) has rows \([1,3]/[3].\) The semistandard tableaux of shape \((2,1)\) with entries at most \(3\) have the following right-key weights, computed via Mason’s SSYT-to-SSAF bijection [Mas09]: \[\begin{array}{cccc} T & \mathrm{wt}(T) & \mathrm{wt}(K_+(T)) & K_+(T)\leq \mathrm{key}(\alpha) \\ \hline [1,1]/[2] & (2,1,0) & (2,1,0) & \text{yes} \\ [1,1]/[3] & (2,0,1) & (2,0,1) & \text{yes} \\ [1,2]/[2] & (1,2,0) & (1,2,0) & \text{yes} \\ [1,2]/[3] & (1,1,1) & (0,2,1) & \text{no} \\ [1,3]/[2] & (1,1,1) & (1,0,2) & \text{yes} \\ [1,3]/[3] & (1,0,2) & (1,0,2) & \text{yes} \\ [2,2]/[3] & (0,2,1) & (0,2,1) & \text{no} \\ [2,3]/[3] & (0,1,2) & (0,1,2) & \text{no} \end{array}\] The five tableaux marked yes have weights \((2,1,0),\) \((2,0,1),\) \((1,2,0),\) \((1,1,1),\) and \((1,0,2),\) giving the same polynomial as the SSAF computation above.

For classical background on tableaux, Gelfand–Tsetlin patterns, and branching rules around key-tableau combinatorics, see [Pro94]. The Bruhat-order side of the divided-difference formulas and the standard elementary monomials below is closely related to the chain constructions of A. Postnikov and R. P. Stanley [PS08].

#Definition (SSYT)

A key tableau is a semistandard tableau such that the entries in column \(j+1\) are a subset of the entries in column \(j,\) for all \(j.\)

Below is the unique key tableau with weight \((1,3,0,1,2,4)\):

$1 $ $ 2 $ $ 2 $ $ 6$ $ 2 $ $ 5 $ $ 6$   $ 4 $ $ 6$     $ 5$       $ 6$      

The map that sends a key to its weight is a bijection between the set of key tableaux and the set of compositions. Given a composition \(\alpha = (\alpha_1,\dotsc,\alpha_\ell),\) place a cell \(j\) in the first \(\alpha_j\) columns. This produces a unique key tableau, \(\mathrm{key}(\alpha),\) of shape \(\sort(\alpha).\)

R. Hodges and A. Yong characterize multiplicity-free key polynomials [HY22]. They also relate Coxeter combinatorics to spherical Schubert geometry [HY20].

Given a semistandard tableau \(T,\) we can compute its right key \(K_+(T),\) via a direct but involved process. A simpler method is proved in [Mas09]. The key polynomial can then be computed by \[\key_\alpha(\xvec) = \sum_{\substack{T \in \SSYT(\sort(\alpha)) \\ K_+(T) \leq \mathrm{key}(\alpha)}} \xvec^T\] where we sum over all semistandard tableaux \(T\) whose right key, \(K_+(T),\) is entrywise weakly smaller than \(\mathrm{key}(\alpha).\)

Similarly, the Demazure atoms are given as the sum over semistandard tableaux with a given right key: \[\atom_\alpha(\xvec) = \sum_{\substack{T \in \SSYT(\sort(\alpha)) \\ K_+(T) = \mathrm{key}(\alpha)}} \xvec^T\]

#Keys via Kostant partition function

Let \(\Phi^+=\{ \evec_i-\evec_j : 1 \leq i \lt{} j \leq n\}\) be the positive roots of the root system of type \(A_{n-1}.\) For a multiset \(\Gamma\) of roots in \(\Phi^+,\) let \(\kostantP_\Gamma(\nu)\) be the corresponding Kostant partition function, defined by \[\prod_{\gamma \in \Gamma} \frac{1}{1-\xvec^{-\gamma}} = \sum_{\nu} \kostantP_\Gamma(\nu)\xvec^{-\nu}.\] This is a vector partition function in the sense of [Stu95].

Fix a word \(i_1,\dotsc,i_\ell\) such that \[\key_\alpha(\xvec)=\pi_{i_\ell}\dotsm\pi_{i_1}(\xvec^\lambda),\] where \(\lambda=\sort(\alpha).\) Writing \(\delta_i=\evec_i-\evec_{i+1},\) the operator identity \[\pi_i(F)= \frac{F}{1-\xvec^{-\delta_i}} - \frac{\xvec^{-\delta_i}s_i(F)}{1-\xvec^{-\delta_i}}\] lets us expand one Demazure operator at a time. If a reflected denominator root becomes negative, rewrite it using \[\frac{1}{1-\xvec^\gamma} = -\frac{\xvec^{-\gamma}}{1-\xvec^{-\gamma}}.\] After all roots are made positive, this gives a finite signed list of triples \((c,\beta,\Gamma)\) with \[\key_\alpha(\xvec) = \sum_{(c,\beta,\Gamma)} c\,\xvec^\beta \prod_{\gamma \in \Gamma}\frac{1}{1-\xvec^{-\gamma}}.\]

Example (Key polynomial from root system).

The key polynomial \(\key_{02}=\pi_1(x_1^2)\) gives \[\key_{02} = \frac{x_1^2}{1-x_2/x_1} - \frac{x_1^{-1}x_2^3}{1-x_2/x_1} =x_1^2+x_1x_2+x_2^2.\]

#Representation theory of \(GL_n\)

For representation-theoretic background, see the introduction of [FGPS20].

V. Lakshmibai, P. Littelmann, and P. Magyar prove that the crystal of standard tableaux for a generalized Demazure module is a disjoint union of ordinary Demazure crystals [LLM02, Thm. 2]. Their Corollary 10 gives the corresponding nested isobaric-Demazure operator formula for its character. More explicitly, their tensor product rule decomposes the tensor product of a highest-weight line with a Demazure module into Demazure components indexed by the LS paths whose concatenations remain dominant [LLM02, Cor. 10, Prop. 12].

#Lascoux’s tableauhedron

A. Lascoux uses the name tableauhedron for a tableau/crystal construction that behaves like a weighted Eulerian incidence structure [Las12, pp. 13–24]. Let \(\lambda\) be a strict partition and choose a reduced word \(w=s_{i_1}\dotsm s_{i_\ell}.\) On the crystal of tableaux of shape \(\lambda,\) the reflection \(s_i\) reverses an \(i\)-string, while \(\pi_i\) sends the head of that string to the sum of all its elements. Lascoux combines these actions in \[d_i=\overline{\pi}_i\otimes s_i+1\otimes\pi_i =\pi_i\otimes s_i+1\otimes\theta_i, \qquad \theta_i=\overline{\pi}_i-s_i=\pi_i-1-s_i.\] The expansion of \(d_{i_1}\dotsm d_{i_\ell}\) records tableaux \(T\) with prescribed endpoints: their left key \(K_-(T)\) and right key \(K_+(T).\) In particular, the terms ending at \(w\) have \(K_+(T)=\lambda w,\) while the first tensor factor records \(K_-(T).\)

For key labels \(\sigma\) and \(\zeta\) in the orbit of \(\lambda,\) define the weighted incidence matrix \[\mathcal E[\sigma,\zeta] \coloneqq \sum_{\substack{T:\ K_-(T)=\sigma\\K_+(T)=\zeta}} \xvec^{\operatorname{wt}(T)}.\] Filter \(\mathcal E=\mathcal E_0+\mathcal E_1+\dotsb\) by the distance between the two keys. If \(f^\clubsuit(x_1,\dotsc,x_n)=f(x_1^{-1},\dotsc,x_n^{-1}),\) then Lascoux’s weighted Euler relation is [Las12, p. 22] \[\mathcal E^{-1} =\mathcal E_0^\clubsuit-\mathcal E_1^\clubsuit +\mathcal E_2^\clubsuit-\mathcal E_3^\clubsuit+\dotsb.\]

Example (The \(s_1s_2\) tableauhedron).

Take \(\lambda=(4,2,0)\) and let \(T_\lambda\) be the highest tableau shown below.

$1$ $1$ $1$ $1$ $ 2$ $2$    

For the word \(s_1s_2,\) the key vertices are \(420,\) \(240,\) \(402,\) and \(204.\) After tableau weights are specialized to \(1,\) the nonzero incidence multiplicities are \[\begin{aligned} m(420,240)&=1, & m(420,402)&=1, & m(420,204)&=2,\\ m(240,204)&=3, & m(402,204)&=1. \end{aligned}\] The rank-two Euler relation becomes [Las12, pp. 17–18] \[2\cdot2=1\cdot3+1\cdot1.\] The tableau-valued relation used in Lascoux’s \(n=4\) Hilbert-numerator calculation is \(2t_3\sim t_2t_5+t_2t_6,\) where the \(t_i\) are the six non-key tableaux displayed there; it removes a negative intermediate term before specialization [Las12, pp. 27–28].

A compatible chain of tableaux is a sequence \(T_1,\dotsc,T_m\) satisfying \[K_+(T_j)\leq K_-(T_{j+1}) \qquad(1\leq j\lt{}m).\] These chains are the standard-monomial objects behind the Hilbert function \[L_{\lambda,w}(m)\coloneqq \key_{m\lambda,w}(1^n).\] Writing \(d=\deg_m L_{\lambda,w}(m)\) defines the key–Ehrhart numerator \(E_{\lambda,w}(z)\) by \[\sum_{m\geq0}L_{\lambda,w}(m)z^m =\frac{E_{\lambda,w}(z)}{(1-z)^{d+1}}.\] Lascoux proposes the tableauhedron as a structure for understanding this positive Hilbert numerator, while noting that its direct description in tableauhedron terms remains to be written [Las12, pp. 24–26]. The same dilation count has a separate union-of-GT-faces model.

Despite its name, the tableauhedron in this source is not presented as an established convex polytope. There is also an essential reduced-word caveat: the operators \(d_i\) do not satisfy the braid relations. Consequently, the raw graph or incidence presentation may depend on the chosen reduced word. The Euler relations explain cancellations after evaluation, but the source does not construct a reduced-word-independent Euler quotient, much less a canonical polytope [Las12, pp. 14, 19–22].

#Products of key polynomials

A product of key polynomials is not in general key-positive. However, in some instances such a product is key-positive; see [Kou18].

G. Z. D. e. Moura’s senior thesis surveys operator, tableau, plactic, and crystal models for key and atom polynomials [Mou24]. The product-coefficient problem is a central motivation.

#The Reiner–Shimozono conjecture

The Reiner–Shimozono conjecture predicted that every product of two key polynomials expands positively into Demazure atoms. R. Hodges constructs an infinite family of Reiner–Shimozono counterexamples . For compositions \(a,b,c\) in \(4(p+q-1)\) variables, his family satisfies \[[\atom_c](\key_a\key_b) = N(p+q-1,p)\bigl(2-(p-2)(q-2)\bigr),\] where \(N(r,k)\) is a Narayana number [Hod26, Thm. 1.1]. Thus the coefficient is negative exactly when \((p-2)(q-2)\gt{}2\); the first examples in the family occur in 28 variables and have coefficients \(-105\) and \(-350.\) The three-variable positivity theorem of A. Pun remains valid [Pun16].

The same counterexamples disprove Polo’s conjecture that tensor products of section modules on Schubert varieties admit Schubert filtrations [Hod26, Cor. 1.2]. Hodges also gives an exact coefficient formula and a polynomial-time sufficient test for positivity on a large family of atom coefficients. The \(K\)-theoretic consequence is recorded under products and Lascoux atoms.

T. C. Miller proves a positive combinatorial rule for multiplying a permuted-basement Demazure atom by a Schur polynomial [Mil25]. The rule is given by a compatible pair of vertex models for the atom and the Schur factor, and it specializes to product rules for ordinary Demazure atoms and characters. R. Paten and D. Woodruff extend several Schur-positivity results to key positivity by replacing Schur polynomials with flagged Schur polynomials [PW26]. In particular, they prove key positivity for many Temperley–Lieb immanants of flagged Jacobi–Trudi matrices, give a key-expansion rule for most products of flagged skew Schur polynomials, and prove a related log-concavity result using Demazure crystals.

#Pieri rule for key polynomials

A Pieri rule for key polynomials, described via an Robinson–Schensted–Knuth-type algorithm, is given by S. Assaf and D. Quijada in [AQ19]. Their rule expands the product of an arbitrary key polynomial with a single-part key polynomial in the key basis. Unlike general key products, this Pieri case admits a cancellation-free, multiplicity-free formula. The proof replaces ordinary row insertion with an insertion algorithm on Kohnert diagrams.

N. Cape and S. Zemel study generating series of key polynomials in a modified Demazure algebra [CZ24]. For a fixed permutation \(w,\) the generating function \(K_w(\xvec,\tvec)=\sum_\lambda K_{\lambda,w}(\xvec)\tvec^\lambda\) is a rational function whose denominator is described by bounded ascending sequences determined by the first values of \(w\) [CZ24, Thm. 3.9]. The numerator has structured quadratic terms governed by multisets with multiple presentations as sums of such bounded sequences.

#Skew key polynomials

In [AW19], the authors introduce skew key polynomials, and show that these are positive in the key basis. They use weak dual equivalence to obtain their result. This generalizes an earlier result by V. Reiner and M. Shimozono [RS95]. Combining this key-positive expansion with the positive expansion of keys into Demazure atoms gives an atom-positive expansion of skew key polynomials.

#Complete flagged homogeneous polynomials

H. Ehrhard [Ehr23] introduces complete flagged homogeneous polynomials . For a weak composition \(a=(a_1,a_2,\dotsc),\) they are defined by \[h_a(\xvec) \coloneqq \prod_{i\geq 1} \completeH_{a_i}(x_1,\dotsc,x_i).\] They form a \(\setZ\)-basis for the polynomial ring, and their stable limit is the usual complete homogeneous symmetric function \(\completeH_{\sort(a)}.\)

Ehrhard gives a nonnegative expansion of these polynomials in key polynomials using a flagged version of the RSK correspondence. Since keys are atom-positive, the complete flagged homogeneous polynomials are also Demazure atom-positive. Conversely, key polynomials have a signed expansion in the complete flagged homogeneous basis.

#Demazure atoms

The Demazure atoms (originally called standard bases) may be defined in a manner similar to key polynomials using operators. They were introduced by A. Lascoux and M.-P. Schützenberger in [LS90]. Mason’s semistandard augmented filling model gives a positive monomial expansion [Mas09]. They also expand positively in the fundamental particle basis [Sea19, HN24]. The sourced skew analogue recorded here is the skew key polynomial, rather than a separate skew Demazure atom family. B. Brubaker, V. Buciumas, D. Bump, and H. P. A. Gustafsson construct solvable colored five-vertex lattice models whose partition functions are type \(A\) Demazure atoms [BBBG21]. Their proof uses a colored Yang–Baxter equation, and the construction also gives algorithms for computing Lascoux–Schützenberger keys. Using the notation for divided difference operators, let \(\theta_i \coloneqq \pi_i -1.\) These satisfy the braid relations and we have \(\theta_i \theta_j = \theta_j \theta_i\) whenever \(|i-j| \geq 2.\) However, \(\theta_i^2 = 0,\) so we must now pay extra attention to choices of permutations.

Let \(\lambda\) be a partition with at most \(n\) parts, and let \(\sigma \in \symS_n\) be a minimal coset representative in \(\symS_n / Stab_n(\lambda).\) The Demazure atom \(\atom_{\lambda,\sigma}(z)\) is defined as \[\atom_{\lambda,\sigma}(z) \coloneqq \theta_\sigma\left( z_1^{\lambda_1} \dotsm z_n^{\lambda_n} \right).\] Again, instead of using \((\lambda,\sigma)\) as an index, we use \(\sigma(\lambda)\) as an index. Here, we must choose \(\sigma\) to be the shortest permutation \(\sigma\) that sends \(\lambda\) to \(\alpha = \sigma(\lambda).\)

For example, if \(\alpha = 1113,\) then \(\lambda=3111,\) and we must pick \(\sigma = 4123,\) and \[\atom_{1113}(z) = \atom_{3111,4123}(z) = z_1 z_2 z_3 z_4^3 + z_1 z_2 z_3^2 z_4^2 + z_1 z_2^2 z_3z_4^2 + z_1^2 z_2 z_3 z_4^2.\] Similarly, \[\atom_{103}(z) = \atom_{310,312}(z) = z_1^3 z_2 + z_1^3 z_3 + z_1^2 z_2^2 + z_1^2 z_3^2 + z_1^2 z_2 z_3 + z_1 z_2^3 + z_1 z_3^3 + z_1 z_2 z_3^2 + z_1 z_2^2 z_3.\]

Since \(\pi_i = \theta_i+1,\) it follows that key polynomials are positive in the Demazure atom basis. Indeed, [Pun16, Thm. 2.8] gives \[\key_{\alpha}(z) = \sum_{\beta \leq \alpha} \atom_{\beta}(z),\] where we have \(\beta \leq \alpha\) if one can obtain \(\beta\) from \(\rev(\alpha)\) by successively permuting entries which are in increasing order. For example, \[\key_{301} = \atom_{103} + \atom_{130}+\atom_{301}+\atom_{310}\] since \(103,\) \(130,\) \(301\) and \(310\) can be obtained from \(\rev(301)=103\) by successive swaps of elements (see also Bruhat order). Similarly, \[\key_{002} = \atom_{200} + \atom_{020} + \atom_{002}.\] The notation used here is not uniform in the literature.

Example (Key polynomials into atoms).

\[\key_{202} = \atom_{202}+\atom_{220}\] and \[\key_{301} = \atom_{103} + \atom_{130}+\atom_{301}+\atom_{310}\]

See A. Pun’s PhD thesis for a good overview of Demazure atoms and key polynomials [Pun16].

S. Armon studies atom-positivity through Demazure crystals [Arm23]. The paper gives a recursive formula for crystal Demazure atoms, generalizing a result of Lascoux–Schützenberger, and separates the notions of extremal subsets and atom-positive subsets in the crystal setting.

#Cauchy kernel

A bijective proof of the Cauchy-type identity below is given in [Las03, Thm. 6]. The proof uses the Robinson–Schensted–Knuth correspondence.

Theorem (See [Las03, Thm. 6]).

We have \[\prod_{i+j \leq n+1} (1-x_iy_j)^{-1} = \sum_{\alpha \in \setN^n} \atom_{w_0\alpha}(\xvec) \key_{\alpha}(\yvec).\]

In [FL09], the authors prove this formula and several other Cauchy-type identities involving key polynomials and Demazure atoms in other types.

A generalization to truncated staircase shapes is provided by O. Azenhas and A. Emami in [AE15]. They use a version of RSK introduced by S. Mason in [Mas08].

E. Feigin, A. Khoroshkin, and I. Makedonskyi [FKM24] extend this circle of Cauchy identities from triangular matrices to arbitrary staircase-shaped matrices. Their standard filtrations give positive Cauchy identities whose terms are products of key polynomials and Demazure atoms, as well as an alternating-sign identity involving products of key polynomials.

L. Pena uses ordinary RSK to treat matrices supported on an arbitrary skew Ferrers shape [Pen26]. The outer boundary gives an upper bound on the right key of the insertion tableau, while the inner boundary gives a lower bound on its left key; both bounds depend on the recording tableau. This yields positive Cauchy expansions in Demazure atoms and Lascoux–Schützenberger standard basis polynomials, indexed by Bruhat intervals [Pen26, Thm. 25 and Cor. 50]. A specialization recovers the Cauchy identity for \(m\)-symmetric Schur functions at \(t=0.\)

E. Feigin, I. Makedonskyi, and D. Orr interpret the \(t=0\) specialization of the Mimachi–Noumi nonsymmetric \(q\)-Cauchy identity representation-theoretically [FMO23]. They realize the product side as a character of functions on a matrix space and identify the associated graded pieces with tensor products of generalized global Weyl modules for the Iwahori algebra.

An alternative proof also appears in [CK17] where the authors use \(U_q(\mathfrak{g})\) crystals.

See also [AGL22] for the connection between the Cauchy kernel, RSK, crystals and last passage percolation.

Example (Personal communication, Vasu Tewari 2019).

Recall the Cauchy identity for Schubert polynomials (see e.g. [PS08, p. 30]). \[\sum_{w \in \symS_n} \schubert_w(\xvec) \schubert_{w w_0}(\yvec) = \prod_{i+j \leq n} (1 + x_iy_j) = \prod_{k=1}^{n-1}\sum_{j=0}^k y_{n-k}^{k-j} \elementaryE_{j}(x_1,\dotsc,x_k).\] Since the Schubert polynomials are positive in the key basis, it follows that the standard elementary monomials are key-positive.

#Demazure keys and Demazure atoms in type \(B,\) \(C\) and \(D\)

In [FL09], A. Fu and A. Lascoux define divided difference operators that allow us to define key polynomials and Demazure atoms in types \(B,\) \(C\) and \(D.\)

Let \(s_i\) interchange \(x_i\) and \(x_{i+1}\) for \(1 \leq i \lt{} n,\) let \(s_n\) send \(x_n\) to \(x_n^{-1},\) and let \(\tau_n\) send \((x_{n-1},x_n)\) to \((x_n^{-1},x_{n-1}^{-1}).\) Fu and Lascoux write operators on the right. With \(f^w\) denoting the action of \(w\) on \(f,\) their isobaric divided differences are \[\begin{aligned} f\pi_i &= \frac{x_i f-x_{i+1}f^{s_i}}{x_i-x_{i+1}}, &&1 \leq i \lt{} n,\\ f\pi_n^C &= \frac{x_n f-x_n^{-1}f^{s_n}}{x_n-x_n^{-1}},\\ f\pi_n^B &= \frac{x_n f-f^{s_n}}{x_n-1},\\ f\pi_n^D &= \frac{f-x_{n-1}^{-1}x_n^{-1}f^{\tau_n}} {1-x_{n-1}^{-1}x_n^{-1}}. \end{aligned}\] They also use the second family \(\widehat{\pi}_i\coloneqq\pi_i-1\) and \(\widehat{\pi}_n^\heartsuit\coloneqq\pi_n^\heartsuit-1,\) for \(\heartsuit=B,C,D.\) The \(\pi\)-operators give the type \(B,\) \(C,\) and \(D\) Demazure characters by applying products of operators to dominant monomials, while the hatted operators give the corresponding atom-like family [FL09, Sec. 3].

In particular, the type \(C\) key polynomials contain the symplectic Schur functions. There are operator, crystal-graph, and key-tableau definitions of these polynomials.

See also [RY11], since key polynomials are specializations of nonsymmetric Macdonald polynomials.

#Type \(B/C\) key polynomials

In [San21], J. M. Santos gives combinatorial formulas for the type \(C\) key polynomials and Demazure atom polynomials. The type \(C\) key polynomials expand positively into type \(C\) Demazure atoms, by summing over an ideal in the Bruhat poset; see [San21, Prop. 53]. This is analogous to the type \(A\) setting. A crystal characterization is also given, as well as analogues of key tableaux.

V. Buciumas and T. Scrimshaw construct quasi-solvable lattice models for the \(\mathrm{Sp}_{2n}\) and \(\mathrm{SO}_{2n+1}\) Demazure atoms and characters [BS22]. This extends the vertex-model viewpoint on keys and atoms beyond type \(A.\)

#Type \(B/C\) Demazure atoms

See [FL09] for definitions of key polynomials in other types. These are related to the orthogonal and symplectic Schur functions.

Bibliography

  1. [AA19]Per Alexandersson and Elie Alhajjar. Ehrhart positivity and Demazure characters. Algebraic and geometric combinatorics on lattice polytopes, June 2019.
    .bib
    @inproceedings{AlexanderssonAlhajjar2018,
      doi = {10.1142/9789811200489_0003},
      url2 = {https://doi.org/10.1142/9789811200489_0003},
      year = {2019},
      month = jun,
      publisher = {World Scientific},
      author = {Per Alexandersson and Elie Alhajjar},
      title = {Ehrhart positivity and {D}emazure characters},
      booktitle = {Algebraic and Geometric Combinatorics on Lattice Polytopes}
    }
    
  2. [AS19]Per Alexandersson and Mehtaab Sawhney. Properties of non-symmetric Macdonald polynomials at $q=1$ and $q=0$. Annals of Combinatorics, 23(2):219–239, May 2019.
    .bib
    @article{AlexanderssonSawhney2019,
      doi = {10.1007/s00026-019-00432-z},
      url2 = {https://doi.org/10.1007/s00026-019-00432-z},
      volume = {23},
      number = {2},
      pages = {219--239},
      year = {2019},
      month = may,
      publisher = {Springer Science and Business Media {LLC}},
      author = {Per Alexandersson and Mehtaab Sawhney},
      title = {Properties of Non-symmetric {M}acdonald Polynomials at $q=1$ and $q=0$},
      journal = {Annals of Combinatorics}
    }
    
  3. [Arm23]Sam Armon. Extremal subsets and atom-positivity. arXiv:2310.14584, 2023.
    .bib
    @article{Armon2023x,
      author = {Sam Armon},
      title = {Extremal subsets and atom-positivity},
      year = {2023},
      eprint = {2310.14584},
      url = {https://arxiv.org/abs/2310.14584},
      journal = {arXiv e-prints}
    }
    
  4. [AQ19]Sami Assaf and Danjoseph Quijada. A Pieri rule for Demazure characters of the general linear group. arXiv:1908.08502, 2019.
    .bib
    @article{AssafQuijada2019x,
    Author = {Sami Assaf and Danjoseph Quijada},
    Title = {A {P}ieri rule for {D}emazure characters of the general linear group},
    Year = {2019},
    Eprint = {1908.08502},
      url = {https://arxiv.org/abs/1908.08502},
    journal = {arXiv e-prints}
    }
    
  5. [AS18]Sami Assaf and Dominic Searles. Kohnert tableaux and a lifting of quasi-Schur functions. Journal of Combinatorial Theory, Series A, 156:85–118, May 2018.
    .bib
    @article{AssafSearles2018,
      doi = {10.1016/j.jcta.2018.01.001},
      url2 = {https://doi.org/10.1016/j.jcta.2018.01.001},
      year = {2018},
      month = may,
      publisher = {Elsevier {BV}},
      volume = {156},
      pages = {85--118},
      author = {Sami Assaf and Dominic Searles},
      title = {Kohnert tableaux and a lifting of quasi-{S}chur functions},
      journal = {Journal of Combinatorial Theory,  Series A}
    }
    
  6. [AW19]Sami Assaf and Stephanie Willigenburg. Skew key polynomials and a generalized Littlewood–Richardson rule. arXiv:1905.11526, 2019.
    .bib
    @article{AssafvanWilligenburg2019,
    Author = {Sami Assaf and Stephanie {van Willigenburg}},
    Title = {Skew key polynomials and a generalized {L}ittlewood--{R}ichardson rule},
    Year = {2019},
    journal = {arXiv e-prints},
    Eprint = {1905.11526}
    }
    
  7. [AE15]Olga Azenhas and Aram Emami. An analogue of the robinson–schensted–knuth correspondence and non-symmetric Cauchy kernels for truncated staircases. European Journal of Combinatorics, 46:16–44, May 2015.
    .bib
    @article{AzenhasEmami2015,
      doi = {10.1016/j.ejc.2014.11.006},
      url2 = {https://doi.org/10.1016/j.ejc.2014.11.006},
      year = {2015},
      month = may,
      publisher = {Elsevier {BV}},
      volume = {46},
      pages = {16--44},
      author = {Olga Azenhas and Aram Emami},
      title = {An analogue of the Robinson--Schensted--Knuth correspondence and non-symmetric {C}auchy kernels for truncated staircases},
      journal = {European Journal of Combinatorics}
    }
    
  8. [AGL22]Olga Azenhas, Thomas Gobet and Cédric Lecouvey. Non symmetric Cauchy kernel, crystals and last passage percolation. arXiv:2212.06587, 2022.
    .bib
    @article{AzenhasGobetLecouvey2022x,
    Author = {Olga Azenhas and Thomas Gobet and Cédric Lecouvey},
    Title = {Non symmetric {C}auchy kernel, crystals and last passage percolation},
    Year = {2022},
    Eprint = {2212.06587},
      url = {https://arxiv.org/abs/2212.06587},
    journal = {arXiv e-prints}
    }
    
  9. [BBBG21]Ben Brubaker, Valentin Buciumas, Daniel Bump and Henrik P. A. Gustafsson. Colored five-vertex models and Demazure atoms. Journal of Combinatorial Theory, Series A, 178:105354, February 2021.
    .bib
    @article{BrubakerBuciumasBumpGustafsson2021,
      title = {Colored five-vertex models and {D}emazure atoms},
      volume = {178},
      ISSN = {0097-3165},
      url = {http://dx.doi.org/10.1016/j.jcta.2020.105354},
      DOI = {10.1016/j.jcta.2020.105354},
      journal = {Journal of Combinatorial Theory,  Series A},
      publisher = {Elsevier BV},
      author = {Brubaker,  Ben and Buciumas,  Valentin and Bump,  Daniel and Gustafsson,  Henrik P.A.},
      year = {2021},
      month = feb,
      pages = {105354}
    }
    
  10. [BS22]Valentin Buciumas and Travis Scrimshaw. Quasi-solvable lattice models for $\mathrm{Sp}_{2n}$ and $\mathrm{SO}_{2n+1}$ Demazure atoms and characters. Forum of Mathematics, Sigma, 10, 2022.
    .bib
    @article{BuciumasScrimshaw2022,
      author = {Valentin Buciumas and Travis Scrimshaw},
      title = {Quasi-solvable lattice models for {$\mathrm{Sp}_{2n}$} and
        {$\mathrm{SO}_{2n+1}$} {D}emazure atoms and characters},
      year = {2022},
      journal = {Forum of Mathematics, Sigma},
      volume = {10},
      doi = {10.1017/fms.2022.49},
      eprint = {2101.08907}
    }
    
  11. [CZ24]Noah Cape and Shaul Zemel. Generating Series of Key Polynomials and Bounded Ascending Sequences of Integers. arXiv:2411.08465, 2024.
    .bib
    @article{CapeZemel2024x,
      author = {Noah Cape and Shaul Zemel},
      title = {Generating {S}eries of {K}ey {P}olynomials and {B}ounded {A}scending {S}equences of {I}ntegers},
      year = {2024},
      eprint = {2411.08465},
      url = {https://arxiv.org/abs/2411.08465},
      journal = {arXiv e-prints}
    }
    
  12. [CK17]Seung-Il Choi and Jae-Hoon Kwon. Lakshmibai–Seshadri paths and non-symmetric Cauchy identity. Algebras and Representation Theory, 21(6):1381–1394, December 2017.
    .bib
    @article{ChoiKwon2017,
      doi = {10.1007/s10468-017-9752-6},
      url2 = {https://doi.org/10.1007/s10468-017-9752-6},
      year = {2017},
      month = dec,
      publisher = {Springer Nature},
      volume = {21},
      number = {6},
      pages = {1381--1394},
      author = {Seung-Il Choi and Jae-Hoon Kwon},
      title = {{L}akshmibai--{S}eshadri Paths and Non-Symmetric {C}auchy Identity},
      journal = {Algebras and Representation Theory}
    }
    
  13. [Mou24]Guilherme Zeus Dantas Moura. Combinatorial models for key polynomials and atom polynomials. 2024. Senior thesis, Haverford College
    .bib
    @misc{DantasEMoura2024Thesis,
      author = {Guilherme Zeus Dantas e Moura},
      title = {Combinatorial models for key polynomials and atom polynomials},
      year = {2024},
      note = {Senior thesis, Haverford College},
      url = {https://guilhermezeus.com/maththesis.pdf}
    }
    
  14. [Dem74]Michel Demazure. Désingularisation des variétés de schubert généralisées. Annales scientifiques de l’École normale supérieure, 7(1):53–88, 1974.
    .bib
    @article{Demazure1974,
      doi = {10.24033/asens.1261},
      url2 = {https://doi.org/10.24033/asens.1261},
      year  = {1974},
      publisher = {Societe Mathematique de France},
      volume = {7},
      number = {1},
      pages = {53--88},
      author = {Michel Demazure},
      title = {D{\'{e}}singularisation des vari{\'{e}}t{\'{e}}s de Schubert g{\'{e}}n{\'{e}}ralis{\'{e}}es},
      journal = {Annales scientifiques de l'{\'{E}}cole normale sup{\'{e}}rieure}
    }
    
  15. [Dem74]Michel Demazure. Une nouvelle formule des caractères. Bulletin des Sciences Mathématiques, 98(3):163–172, 1974.
    .bib
    @article{Demazure1974nouvelle,
    title = {Une nouvelle formule des caract{\`{e}}res},
    journal = {Bulletin des Sciences Math{\'{e}}matiques},
    volume = {98},
    number = {3},
    pages = {163--172},
    year = {1974},
    author = {Michel Demazure}
    }
    
  16. [Ehr23]Henry Ehrhard. Complete flagged homogeneous polynomials. arXiv:2305.03241, 2023.
    .bib
    @article{Ehrhard2023x,
      author = {Henry Ehrhard},
      title = {Complete flagged homogeneous polynomials},
      year = {2023},
      eprint = {2305.03241},
      url = {https://arxiv.org/abs/2305.03241},
      journal = {arXiv e-prints}
    }
    
  17. [FGPS20]Neil J. Y. Fan, Peter L. Guo, Simon C. Y. Peng and Sophie C. C. Sun. Lattice points in the Newton polytopes of key polynomials. SIAM Journal on Discrete Mathematics, 34(2):1281–1289, January 2020.
    .bib
    @article{FanGuoPengSun2020, 
      title={Lattice Points in the {N}ewton Polytopes of Key Polynomials}, 
      volume={34}, 
      ISSN={1095-7146}, 
      url={http://dx.doi.org/10.1137/19M1305562}, 
      DOI={10.1137/19m1305562}, 
      number={2}, 
      journal={SIAM Journal on Discrete Mathematics}, 
      publisher={Society for Industrial & Applied Mathematics (SIAM)}, 
      author={Fan, Neil J. Y. and Guo, Peter L. and Peng, Simon C. Y. and Sun, Sophie C. C.}, 
      year={2020}, 
      month=jan, 
      pages={1281--1289}
    }
    
  18. [FKM24]Evgeny Feigin, Anton Khoroshkin and Ievgen Makedonskyi. Cauchy identities for staircase matrices. arXiv:2411.03117, 2024.
    .bib
    @article{FeiginKhoroshkinMakedonskyi2024x,
      author = {Evgeny Feigin and Anton Khoroshkin and Ievgen Makedonskyi},
      title = {Cauchy identities for staircase matrices},
      year = {2024},
      eprint = {2411.03117},
      url = {https://arxiv.org/abs/2411.03117},
      journal = {arXiv e-prints}
    }
    
  19. [FMO23]Evgeny Feigin, Ievgen Makedonskyi and Daniel Orr. Nonsymmetric $q$-Cauchy identity and representations of the Iwahori algebra. arXiv:2303.00241, 2023.
    .bib
    @article{FeiginMakedonskyiOrr2023x,
      author = {Evgeny Feigin and Ievgen Makedonskyi and Daniel Orr},
      title = {Nonsymmetric $q$-{C}auchy identity and representations of the {I}wahori algebra},
      year = {2023},
      eprint = {2303.00241},
      url = {https://arxiv.org/abs/2303.00241},
      journal = {arXiv e-prints}
    }
    
  20. [FL09]Amy M. Fu and Alain Lascoux. Non-symmetric Cauchy kernels for the classical groups. Journal of Combinatorial Theory, Series A, 116(4):903–917, May 2009.
    .bib
    @article{FuLascoux2009,
      doi = {10.1016/j.jcta.2008.10.007},
      url2 = {https://doi.org/10.1016/j.jcta.2008.10.007},
      year  = {2009},
      month = may,
      publisher = {Elsevier {BV}},
      volume = {116},
      number = {4},
      pages = {903--917},
      author = {Amy M. Fu and Alain Lascoux},
      title = {Non-symmetric {C}auchy kernels for the classical groups},
      journal = {Journal of Combinatorial Theory,  Series A}
    }
    
  21. [HHL08]James Haglund, Mark D. Haiman and Nicholas A. Loehr. A combinatorial formula for nonsymmetric Macdonald polynomials. American Journal of Mathematics, 130(2):359–383, 2008.
    .bib
    @article{HaglundHaimanLoehr2008,
     ISSN = {00029327, 10806377},
     URL2 = {http://www.jstor.org/stable/40068131},
     doi = {10.1353/ajm.2008.0015},
     author = {James Haglund and Mark D. Haiman and Nicholas A. Loehr},
     journal = {American Journal of Mathematics},
     number = {2},
     pages = {359--383},
     publisher = {The Johns Hopkins University Press},
     title = {A combinatorial formula for nonsymmetric {M}acdonald polynomials},
     volume = {130},
     year = {2008}
    }
    
  22. [HN24]Angela Hicks and Elizabeth Niese. Quasisymmetric divided difference operators and polynomial bases. arXiv:2406.02420, 2024.
    .bib
    @article{HicksNiese2024x,
      author = {Angela Hicks and Elizabeth Niese},
      title = {Quasisymmetric divided difference operators and polynomial bases},
      year = {2024},
      eprint = {2406.02420},
      url = {https://arxiv.org/abs/2406.02420},
      journal = {arXiv e-prints}
    }
    
  23. [Hod26]Reuven Hodges. Counterexamples to the Reiner-Shimozono conjecture and the failure of Schubert filtrations. arXiv:2609.28169v1, 2026.
    .bib
    @article{Hodges2026x,
      author = {Reuven Hodges},
      title = {Counterexamples to the {R}einer-{S}himozono conjecture and the failure of {S}chubert filtrations},
      year = {2026},
      eprint = {2609.28169v1},
      url = {https://arxiv.org/abs/2609.28169v1},
      journal = {arXiv e-prints}
    }
    
  24. [HY20]Reuven Hodges and Alexander Yong. Coxeter combinatorics and spherical Schubert geometry. arXiv:2007.09238, 2020.
    .bib
    @article{HodgesYong2020Spherical,
      author = {Reuven Hodges and Alexander Yong},
      title = {Coxeter combinatorics and spherical {S}chubert geometry},
      year = {2020},
      eprint = {2007.09238},
      archivePrefix = {arXiv},
      primaryClass = {math.CO}
    }
    
  25. [HY22]Reuven Hodges and Alexander Yong. Multiplicity-free key polynomials. Annals of Combinatorics, 27(2):387–411, 2022.
    .bib
    @article{HodgesYong2022,
      author = {Reuven Hodges and Alexander Yong},
      title = {Multiplicity-free key polynomials},
      year = {2022},
      journal = {Annals of Combinatorics},
      volume = {27},
      number = {2},
      pages = {387--411},
      doi = {10.1007/s00026-022-00574-7},
      eprint = {2007.09229}
    }
    
  26. [Kir25]Valentina Kiritchenko. Simple geometric mitosis. Journal of Combinatorial Theory, Series A, 213:106022, 2025.
    .bib
    @article{Kiritchenko2025,
      author = {Kiritchenko, Valentina},
      title = {Simple geometric mitosis},
      year = {2025},
      journal = {Journal of Combinatorial Theory, Series A},
      volume = {213},
      pages = {106022},
      publisher = {Elsevier BV},
      doi = {10.1016/j.jcta.2025.106022},
      url = {https://doi.org/10.1016/j.jcta.2025.106022},
      eprint = {2301.00225}
    }
    
  27. [KST12]Valentina A. Kiritchenko, Evgeny Yu Smirnov and Vladlen A. Timorin. Schubert calculus and Gelfand–Zetlin polytopes. Russian Mathematical Surveys, 67(4):685, 2012.
    .bib
    @article{KiritchenkoSmirnovTimorin2010,
      author={Valentina A. Kiritchenko and Evgeny Yu Smirnov and Vladlen A. Timorin},
      title={Schubert calculus and {G}elfand--{Z}etlin polytopes},
      journal={Russian Mathematical Surveys},
      volume={67},
      number={4},
      pages={685},
      url={http://stacks.iop.org/0036-0279/67/i=4/a=R02},
      year={2012}
    }
    
  28. [Kog00]Mikhail Kogan. Schubert geometry of flag varieties and Gelfand–Cetlin theory. Massachusetts Institute of Technology, 2000.
    .bib
    @PHDTHESIS{Kogan2000schubertgeometry,
        author = {Mikhail Kogan},
        title = {Schubert Geometry of Flag Varieties and {G}elfand--{C}etlin Theory},
        school  = {Massachusetts Institute of Technology},
        url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.9.9419},
        month = jun,
        year = {2000}
    }
    
  29. [Kou18]Takafumi Kouno. Decomposition of tensor products of Demazure crystals. arXiv:1805.00351, 2018.
    .bib
    @article{Kouno2018,
    Author = {Takafumi Kouno},
    Title = {Decomposition of tensor products of {D}emazure crystals},
    Year = {2018},
    Eprint = {1805.00351},
      url = {https://arxiv.org/abs/1805.00351},
    journal = {arXiv e-prints}
    }
    
  30. [Kur16]Daniel Kurland. An exploration of key polynomials. University of Pennsylvania, 2016.
    .bib
    @mastersthesis{Kurland2016,
      author = {Daniel Kurland},
      title = {An exploration of key polynomials},
      type = {B.S Thesis},
      school = {University of Pennsylvania},
      year = {2016}
    }
    
  31. [KRV23]Mrigendra Singh Kushwaha, K. N. Raghavan and Sankaran Viswanath. Simple Procedures for Left and Right Keys of Semi-Standard Young Tableaux. arXiv:2302.08279, 2023.
    .bib
    @article{KushwahaRaghavanViswanath2023x,
      author = {Mrigendra Singh Kushwaha and K. N. Raghavan and Sankaran Viswanath},
      title = {Simple {P}rocedures for {L}eft and {R}ight {K}eys of
        {S}emi-{S}tandard {Y}oung {T}ableaux},
      year = {2023},
      eprint = {2302.08279},
      url = {https://arxiv.org/abs/2302.08279},
      journal = {arXiv e-prints}
    }
    
  32. [LLM02]Venkatramani Lakshmibai, Peter Littelmann and Peter Magyar. Standard monomial theory for Bott–Samelson varieties. Compositio Mathematica, 130(3):293–318, 2002.
    .bib
    @article{LakshmibaiLittelmannMagyar2002,
      author = {Venkatramani Lakshmibai and Peter Littelmann and Peter Magyar},
      title = {Standard Monomial Theory for {B}ott--{S}amelson Varieties},
      journal = {Compositio Mathematica},
      volume = {130},
      number = {3},
      pages = {293--318},
      year = {2002},
      doi = {10.1023/A:1014396129323}
    }
    
  33. [LP26]Luc Lapointe and Luis Pena. A new characterization of right keys, and the $m$-symmetric Schur functions at $t=0$. arXiv:2608.13276v1, 2026.
    .bib
    @article{LapointePena2026Keysx,
      author = {Luc Lapointe and Luis Pena},
      title = {A new characterization of right keys, and the $m$-symmetric
        {S}chur functions at $t=0$},
      year = {2026},
      eprint = {2608.13276v1},
      url = {https://arxiv.org/abs/2608.13276v1},
      journal = {arXiv e-prints}
    }
    
  34. [LS90]Alain Lascoux and Marcel-Paul Schützenberger. Keys & standard bases. Invariant theory and tableaux (Minneapolis, MN, 1988), 19:125–144, 1990.
    .bib
    @incollection{Lascoux1990Keys,
        AUTHOR = {Lascoux, Alain and Sch{\"{u}}tzenberger, Marcel-Paul},
         TITLE = {Keys \& standard bases},
     BOOKTITLE = {Invariant theory and tableaux ({M}inneapolis, {MN}, 1988)},
        SERIES = {IMA Vol. Math. Appl.},
        VOLUME = {19},
         PAGES = {125--144},
     PUBLISHER = {Springer, New York},
          YEAR = {1990}
    }
    
  35. [Las03]Alain Lascoux. Double crystal graphs. Studies in memory of Issai Schur:95–114, 2003.
    .bib
    @incollection{Lascoux2003,
      doi = {10.1007/978-1-4612-0045-1_5},
      url2 = {https://doi.org/10.1007/978-1-4612-0045-1_5},
      year = {2003},
      publisher = {Birkh{\"{a}}user Boston},
      pages = {95--114},
      author = {Alain Lascoux},
      title = {Double Crystal Graphs},
      booktitle = {Studies in Memory of {I}ssai {S}chur}
    }
    
  36. [Las12]Alain Lascoux. Tableaux and Eulerian properties of the symmetric group. 2012. Lecture slides for the 5th Mathematical Society of Japan Seasonal Institute, Schubert Calculus, Osaka City University
    .bib
    @misc{Lascoux2012Tableauhedron,
      author = {Alain Lascoux},
      title = {Tableaux and {E}ulerian properties of the symmetric group},
      year = {2012},
      note = {Lecture slides for the 5th Mathematical Society of Japan Seasonal
        Institute, Schubert Calculus, Osaka City University},
      url = {https://www.mathsoc.jp/meeting/msjsi12/file/Lascoux.pdf}
    }
    
  37. [Mas08]Sarah K. Mason. A decomposition of Schur functions and an analogue of the Robinson–Schensted–Knuth algorithm. Séminaire Lotharingien de Combinatoire, 57(B57e), 2008.
    .bib
    @article{Mason2008,
    author = {Sarah K. Mason},
    journal = {S{\'{e}}minaire Lotharingien de Combinatoire},
    language = {eng},
    number = {B57e},
    publisher = {Universit{\"{a}}t Wien, Fakult{\"{a}}t f{\"{u}}r Mathematik},
    title = {A decomposition of {S}chur functions and an analogue of the {R}obinson--{S}chensted--{K}nuth algorithm},
    url = {http://eudml.org/doc/226180},
    volume = {57},
    year = {2008}
    }
    
  38. [Mas09]Sarah K. Mason. An explicit construction of type A Demazure atoms. Journal of Algebraic Combinatorics, 29(3):295–313, 2009.
    .bib
    @article{Mason2009,
      year={2009},
      issn={0925-9899},
      journal={Journal of Algebraic Combinatorics},
      volume={29},
      number={3},
      title={An explicit construction of type {A} {D}emazure atoms},
      doi={10.1007/s10801-008-0133-4},
      publisher={Springer US},
      keywords={Symmetric functions; Young tableaux; Demazure characters},
      author={Sarah K. Mason},
      pages={295--313}
    }
    
  39. [Mil25]Timothy C. Miller. Vertex models for the product of a permuted-basement Demazure atom and a Schur polynomial. arXiv:2503.09240, 2025.
    .bib
    @article{Miller2025x,
      author = {Timothy C. Miller},
      title = {Vertex models for the product of a permuted-basement {D}emazure atom and a {S}chur polynomial},
      year = {2025},
      eprint = {2503.09240},
      url = {https://arxiv.org/abs/2503.09240},
      journal = {arXiv e-prints}
    }
    
  40. [PW26]Rosa Paten and Dora Woodruff. Temperley-Lieb Immanants, Key Positivity, and Demazure Crystals. arXiv:2602.09365, 2026.
    .bib
    @article{PatenWoodruff2026x,
      author = {Rosa Paten and Dora Woodruff},
      title = {Temperley-{L}ieb {I}mmanants, {K}ey {P}ositivity, and {D}emazure
        {C}rystals},
      year = {2026},
      eprint = {2602.09365},
      url = {https://arxiv.org/abs/2602.09365},
      journal = {arXiv e-prints}
    }
    
  41. [Pen26]Luis Pena. Cauchy identities for skew Ferrers shapes via RSK and keys. arXiv:2609.15852v1, 2026.
    .bib
    @article{Pena2026x,
      author = {Luis Pena},
      title = {Cauchy identities for skew {F}errers shapes via {{RSK}} and keys},
      year = {2026},
      eprint = {2609.15852v1},
      url = {https://arxiv.org/abs/2609.15852v1},
      journal = {arXiv e-prints}
    }
    
  42. [PS08]Alexander Postnikov and Richard P. Stanley. Chains in the Bruhat order. Journal of Algebraic Combinatorics, 29(2):133–174, March 2008.
    .bib
    @article{PostnikovStanley2008,
      doi = {10.1007/s10801-008-0125-4},
      url2 = {https://doi.org/10.1007/s10801-008-0125-4},
      year  = {2008},
      month = mar,
      publisher = {Springer Nature},
      volume = {29},
      number = {2},
      pages = {133--174},
      author = {Alexander Postnikov and Richard P. Stanley},
      title = {Chains in the {B}ruhat order},
      journal = {Journal of Algebraic Combinatorics}
    }
    
  43. [Pro94]Robert A. Proctor. Young tableaux, gelfand patterns, and branching rules for classical groups. Journal of Algebra, 164(2):299–360, 1994.
    .bib
    @article{Proctor1994,
      author = {Robert A. Proctor},
      title = {Young tableaux, Gelfand patterns, and branching rules for classical groups},
      year = {1994},
      journal = {Journal of Algebra},
      volume = {164},
      number = {2},
      pages = {299--360},
      doi = {10.1006/jabr.1994.1064},
      url = {https://doi.org/10.1006/jabr.1994.1064}
    }
    
  44. [Pun16]Anna Pun. On decomposition of the product of Demazure atoms and Demazure characters. University of Pennsylvania, 2016.
    .bib
    @PHDTHESIS{Pun2016Thesis,
      author = {Anna Pun},
      title = {On Decomposition of the Product of {D}emazure Atoms and {D}emazure Characters},
      school = {University of Pennsylvania},
      year = {2016},
      url={https://repository.upenn.edu/cgi/viewcontent.cgi?article=3745&context=edissertations},
      month = nov,
      address   =  {PA, USA},
      pages = {1--127}
    }
    
  45. [RY11]Arun Ram and Martha Yip. A combinatorial formula for Macdonald polynomials. Advances in Mathematics, 226(1):309–331, 2011.
    .bib
    @article{RamYip2011,
    title = {A combinatorial formula for {M}acdonald polynomials},
    journal = {Advances in Mathematics},
    volume = {226},
    number = {1},
    pages = {309--331},
    year = {2011},
    issn = {0001-8708},
    doi = {10.1016/j.aim.2010.06.022},
    url2 = {http://www.sciencedirect.com/science/article/pii/S000187081000246X},
    author = {Arun Ram and Martha Yip}
    }
    
  46. [RS95]Victor Reiner and Mark Shimozono. Key polynomials and a flagged Littlewood–Richardson rule. J. Combin. Theory Ser. A, 70(1):107–143, 1995.
    .bib
    @article{ReinerShimozono1995,
        AUTHOR = {Victor Reiner and Mark Shimozono},
         TITLE = {Key polynomials and a flagged {L}ittlewood--{R}ichardson rule},
       JOURNAL = {J. Combin. Theory Ser. A},
      FJOURNAL = {Journal of Combinatorial Theory. Series A},
        VOLUME = {70},
          YEAR = {1995},
        NUMBER = {1},
         PAGES = {107--143},
          ISSN = {0097-3165},
          DOI = {10.1016/0097-3165(95)90083-7}
    }
    
  47. [San21]João Miguel Santos. Symplectic keys and Demazure atoms in type C. The Electronic Journal of Combinatorics, 28(2), June 2021.
    .bib
    @article{Santos2021,
      doi = {10.37236/9235},
      url2 = {https://doi.org/10.37236/9235},
      year = {2021},
      month = jun,
      publisher = {The Electronic Journal of Combinatorics},
      volume = {28},
      number = {2},
      author = {Jo{\~{a}}o Miguel Santos},
      title = {Symplectic Keys and {D}emazure Atoms in Type {C}},
      journal = {The Electronic Journal of Combinatorics}
    }
    
  48. [Sea19]Dominic Searles. Polynomial bases: Positivity and Schur multiplication. Transactions of the American Mathematical Society, 373(2):819–847, 2019.
    .bib
    @article{Searles2019PolynomialBases,
      author = {Searles, Dominic},
      title = {Polynomial bases: {P}ositivity and {S}chur multiplication},
      year = {2019},
      journal = {Transactions of the American Mathematical Society},
      volume = {373},
      number = {2},
      pages = {819--847},
      publisher = {American Mathematical Society},
      doi = {10.1090/tran/7670},
      url = {http://dx.doi.org/10.1090/tran/7670},
      issn = {0002-9947},
      eprint = {1707.01172}
    }
    
  49. [Stu95]Bernd Sturmfels. On vector partition functions. Journal of Combinatorial Theory, Series A, 72(2):302–309, November 1995.
    .bib
    @article{Sturmfels1995,
      doi = {10.1016/0097-3165(95)90067-5},
      url2 = {https://doi.org/10.1016/0097-3165(95)90067-5},
      year = {1995},
      month = nov,
      publisher = {Elsevier {BV}},
      volume = {72},
      number = {2},
      pages = {302--309},
      author = {Bernd Sturmfels},
      title = {On vector partition functions},
      journal = {Journal of Combinatorial Theory,  Series A}
    }
    
  50. [Wei24]Milo Bechtloff Weising. Almost Symmetric Schur Functions. arXiv:2405.01049, 2024.
    .bib
    @article{Weising2024AlmostSymmetricx,
      author = {Milo Bechtloff Weising},
      title = {Almost {S}ymmetric {S}chur {F}unctions},
      year = {2024},
      eprint = {2405.01049},
      url = {https://arxiv.org/abs/2405.01049},
      journal = {arXiv e-prints}
    }
    
  51. [XXZ26]Yihan Xiao, Rui Xiong and Haofeng Zhang. Hybrid pipe dreams for key polynomials. Advances in Applied Mathematics, 173:102979, 2026.
    .bib
    @article{XiaoXiongZhang2026,
      author = {Yihan Xiao and Rui Xiong and Haofeng Zhang},
      title = {Hybrid pipe dreams for key polynomials},
      year = {2026},
      journal = {Advances in Applied Mathematics},
      volume = {173},
      pages = {102979},
      publisher = {Elsevier BV},
      doi = {10.1016/j.aam.2025.102979},
      eprint = {2411.01637},
      url = {https://arxiv.org/abs/2411.01637}
    }
    

I use cookies to detect website issues and track search terms.