Related papers: A Littlewood-Richardson Type Rule for Row-Strict Q…
The classical Littlewood-Richardson rule is a rule for computing coefficients in many areas, and comes in many guises. In this paper we prove two Littlewood-Richardson rules for symmetric skew quasisymmetric Schur functions that are…
We introduce a new combinatorial object, semistandard increasing decomposition tableau and study its relation to a semistandard decomposition tableau introduced by Kra\'skiewicz and developed by Lam and Serrano. We also introduce…
The Schur $P$-, $Q$-multiple zeta functions were defined by Nakasuji and Takeda inspired by the tableau representation of Schur $P$-, $Q$-functions. While a product of two Schur $P$-functions expands as a linear combination of Schur…
Mason and Remmel introduced a basis for quasisymmetric functions known as the row-strict quasisymmetric Schur functions. This basis is generated combinatorially by fillings of composition diagrams that are analogous to the row-strict…
In the prequel to this paper, we showed how results of Mason involving a new combinatorial formula for polynomials that are now known as Demazure atoms (characters of quotients of Demazure modules, called standard bases by Lascoux and…
We give a combinatorial rule for calculating the coefficients in the expansion of a product of two factorial Schur functions. It is a special case of a more general rule which also gives the coefficients in the expansion of a skew factorial…
We introduce a super version of the Littlewood--Richardson rule for super Schur functions over signed alphabets. We give in particular combinatorial interpretations of the super Littlewood--Richardson coefficients using the properties of…
We introduce a family of rings of symmetric functions depending on an infinite sequence of parameters. A distinguished basis of such a ring is comprised by analogues of the Schur functions. The corresponding structure coefficients are…
In previous work with Mikhail Khovanov and Aaron Lauda we introduced two odd analogues of the Schur functions: one via the combinatorics of Young tableaux (odd Kostka numbers) and one via the odd symmetrization operator. In this paper we…
Haglund, Luoto, Mason, and van Willigenburg introduced a basis for quasisymmetric functions called the quasisymmetric Schur function basis, generated combinatorially through fillings of composition diagrams in much the same way as Schur…
We provide direct proofs of product and coproduct formulae for Schur functions where the coefficients (Littlewood--Richardson coefficients) are defined as counting puzzles. The product formula includes a second alphabet for the Schur…
The reduced Schur functions are studied. Their relations to the basic representation of $A^(1)_{r-1}$ and modular representations of the symmetric groups are clarified. Littlewood-Richardson coefficients appear in the linear relations among…
We give a Littlewood-Richardson type rule for expanding the product of a row-strict quasisymmetric Schur function and a symmetric Schur function in terms of row-strict quasisymmetric Schur functions. We then discuss a family of polynomials…
We prove a Littlewood-Richardson type formula for $(s_{\lambda/\mu},s_{\nu/\kappa})_{t^k,t}$, the pairing of two skew Schur functions in the MacDonald inner product at $q = t^k$ for positive integers $k$. This pairing counts graded…
The connection between the generating functions of various sets of tableaux and the appropriate families of quasisymmetric functions is a significant tool to give a direct analytical proof of some advanced bijective results and provide new…
The double Schur functions form a distinguished basis of the ring \Lambda(x||a) which is a multiparameter generalization of the ring of symmetric functions \Lambda(x). The canonical comultiplication on \Lambda(x) is extended to…
Littlewood-Richardson rule gives the decomposition formula for the multiplication of two Schur functions, while the decomposition formula for the multiplication of two Hall-Littlewood functions or two universal characters is also given by…
Using a generalization of the Schensted insertion algorithm to rc-graphs, we provide a Littlewood-Richardson rule for multiplying certain Schubert polynomials by Schur polynomials.
The product of any finite number of factorial Schur functions can be expanded as a $Z[y]$-linear combination of Schur functions. We give a rule for computing the coefficients in such an expansion which generalizes a specialization of the…
We systematically study wreath product Schur functions and give a combinatorial construction using colored partitions and tableaux. The Pieri rule and the Littlewood-Richardson rule are studied. We also discuss the connection with…