相关论文: A Littlewood-Richardson Rule for factorial Schur f…

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…

In this paper, we study Grothendieck polynomials from a combinatorial viewpoint. We introduce the factorial Grothendieck polynomials, analogues of the factorial Schur functions and present some of their properties, and use them to produce a…

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. This expansion follows from several new…

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…

The Schur multiple zeta function was defined as a multivariable function by Nakasuji-Phuksuwan-Yamasaki. Inspired by the product formula of Schur functions, the products of Schur multiple zeta functions have been studied. While the product…

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…

The Bernstein operators allow to build recursively the Schur functions. We present a recursion formula for k-Schur functions at t=1 based on combinatorial operators that generalize the Bernstein operators. The recursion leads immediately to…

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 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 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…

We apply down operators in the affine nilCoxeter algebra to yield explicit combinatorial expansions for certain families of non-commutative k-Schur functions. This yields a combinatorial interpretation for a new family of…

For a given skew shape, we build a crystal graph on the set of all reverse plane partitions that have this shape. As a consequence, we get a simple extension of the Littlewood-Richardson rule for the expansion of the corresponding dual…

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…

The Pieri rule expresses the product of a Schur function and a single row Schur function in terms of Schur functions. We extend the classical Pieri rule by expressing the product of a skew Schur function and a single row Schur function in…

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…

It is known that the Schur expansion of a skew Schur function runs over the interval of partitions, equipped with dominance order, defined by the least and the most dominant Littlewood-Richardson filling of the skew shape. We characterise…

It is an important problem in algebraic combinatorics to deduce the Schur function expansion of a symmetric function whose expansion in terms of the fundamental quasisymmetric function is known. For example, formulas are known for the…

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…

We introduce a class of Schur type functions associated with polynomial sequences of binomial type. This can be regarded as a generalization of the ordinary Schur functions and the factorial Schur functions. This generalization satisfies…

We give an explicit combinatorial formula for the Schur expansion of Macdonald polynomials indexed by partitions with second part at most two. This gives a uniform formula for both hook and two column partitions. The proof comes as a…