English
Related papers

Related papers: Pieri's Formula for Generalized Schur Polynomials

200 papers

Young's lattice is a prototypical example of differential posets. Differential posets have the Robinson correspondence, the correspondence between permutations and pairs of standard tableaux with the same shape, as in the case of Young's…

Combinatorics · Mathematics 2011-04-19 Yasuhide Numata

The Pieri rule is a nonnegative, multiplicity-free formula for the Schur function expansion of the product of an arbitrary Schur function with a single row Schur function. Key polynomials are characters of Demazure modules for the general…

Combinatorics · Mathematics 2019-08-23 Sami Assaf , Danjoseph Quijada

Young's lattice is a partial order on integer partitions whose saturated chains correspond to standard Young tableaux, one type of combinatorial object that generates the Schur basis for symmetric functions. Generalizing Young's lattice, we…

Combinatorics · Mathematics 2022-02-04 Sami Assaf , Stephanie van Willigenburg

We give a combinatorial expansion of the stable Grothendieck polynomials of skew Young diagrams in terms of skew Schur functions, using a new row insertion algorithm for set-valued semistandard tableaux of skew shape. This expansion unifies…

Combinatorics · Mathematics 2020-09-15 Melody Chan , Nathan Pflueger

Jacobi-Trudy formula for a generalisation of Schur polynomials related to any sequence of orthogonal polynomials in one variable is given. As a corollary we have Giambelli formula for generalised Schur polynomials.

Representation Theory · Mathematics 2009-06-10 A. N. Sergeev , A. P. Veselov

We introduce and study a generalization of Schur's $P$-/$Q$-functions associated to a polynomial sequence, which can be viewed as ``Macdonald's ninth variation'' for $P$-/$Q$-functions. This variation includes as special cases Schur's…

Combinatorics · Mathematics 2021-02-08 Soichi Okada

We attempt to explain the ubiquity of tableaux and of Pieri and Cauchy formulae for combinatorially defined families of symmetric functions. We show that such formulae are to be expected from symmetric functions arising from representations…

Combinatorics · Mathematics 2007-05-23 Thomas Lam

The symmetric Grothendieck polynomials generalize Schur polynomials and are Schur-positive by degree. Combinatorially this is manifested as the generalization of semistandard Young tableaux by set-valued tableaux. We define a (weak)…

Combinatorics · Mathematics 2024-12-31 Graham Hawkes

A set of functions is introduced which generalizes the famous Schur polynomials and their connection to Grasmannian manifolds. These functions are shown to provide a new method of constructing solutions to the KP hierarchy of nonlinear…

Mathematical Physics · Physics 2007-05-23 Alex Kasman

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…

Representation Theory · Mathematics 2008-11-04 Minoru Itoh

We present a probabilistic generalization of the Robinson--Schensted correspondence in which a permutation maps to several different pairs of standard Young tableaux with nonzero probability. The probabilities depend on two parameters $q$…

Combinatorics · Mathematics 2021-11-02 Florian Aigner , Gabriel Frieden

Edelman and Greene generalized the Robinson--Schensted--Knuth correspondence to reduced words in order to give a bijective proof of the Schur positivity of Stanley symmetric functions. Stanley symmetric functions may be regarded as the…

Combinatorics · Mathematics 2019-03-15 Sami Assaf

We present a probabilistic generalization of the Robinson--Schensted correspondence in which a permutation maps to several different pairs of standard Young tableaux with nonzero probability. The probabilities depend on two parameters $q$…

Combinatorics · Mathematics 2021-04-29 Florian Aigner , Gabriel Frieden

We study a multi-symmetric generalization of the classical Schur functions called the multi-symmetric Schur functions. These functions form an integral basis for the ring of multi-symmetric functions indexed by tuples of partitions and are…

Combinatorics · Mathematics 2025-09-23 Milo Bechtloff Weising

An element [\Phi] of the Grassmannian of n-dimensional subspaces of the Hardy space H^2, extended over the field C(x_1,..., x_n), may be associated to any polynomial basis {\phi} for C(x). The Pl\"ucker coordinates…

Mathematical Physics · Physics 2019-07-10 J. Harnad , Eunghyun Lee

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.

Combinatorics · Mathematics 2007-05-23 M. Kogan

Schur superpolynomials have been introduced recently as limiting cases of the Macdonald superpolynomials. It turns out that there are two natural super-extensions of the Schur polynomials: in the limit $q=t=0$ and $q=t\rightarrow\infty$,…

Mathematical Physics · Physics 2015-03-12 Olivier Blondeau-Fournier , Pierre Mathieu

We use Young's raising operators to give short and uniform proofs of several well known results about Schur polynomials and symmetric functions, starting from the Jacobi-Trudi identity.

Combinatorics · Mathematics 2013-09-10 Harry Tamvakis

We introduce a new basis for quasisymmetric functions, which arise from a specialization of nonsymmetric Macdonald polynomials to standard bases, also known as Demazure atoms. Our new basis is called the basis of quasisymmetric Schur…

Combinatorics · Mathematics 2010-11-30 J. Haglund , K. Luoto , S. Mason , S. van Willigenburg

Schubert polynomials were introduced in the context of the geometry of flag varieties. This paper investigates some of the connections not yet understood between several combinatorial structures for the construction of Schubert polynomials;…

Combinatorics · Mathematics 2007-05-23 Cristian Lenart
‹ Prev 1 2 3 10 Next ›