Related papers: RC-graphs and a generalized Littlewood-Richardson …
Jack polynomials generalize several classical families of symmetric polynomials, including Schur polynomials, and are further generalized by Macdonald polynomials. In 1989, Richard Stanley conjectured that if the Littlewood-Richardson…
We describe a Schubert induction theorem, a tool for analyzing intersections on a Grassmannian over an arbitrary base ring. The key ingredient in the proof is the Geometric Littlewood-Richardson rule, described in a companion paper.…
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…
Let $R(G)$ be the graph obtained from $G$ by adding a new vertex corresponding to each edge of $G$ and by joining each new vertex to the end vertices of the corresponding edge. Let $RT(G)$ be the graph obtained from $R(G)$ by adding a new…
We give a combinatorial rule for computing intersection numbers on a flag manifold which come from products of Schubert classes pulled back from Grassmannian projections. This rule generalizes the known rule for Grassmannians.
Cohen-Lenstra heuristics for Jacobians of random graphs give rise to random partitions. We connect these random partitions to the Hall-Littlewood polynomials of symmetric function theory, and use this connection to give combinatorial proofs…
We give a formula for pushing forward the classes of Hall-Littlewood polynomials in Grassmann bundles, generalizing Gysin formulas for Schur S- and Q-functions.
We give a new Littlewood-Richardson rule for the Schubert structure coefficients of isotropic Grassmannians, equivalently for the multiplication of $P$-Schur functions. Serrano (2010) previously gave a formula in terms of classes in his…
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.
We introduce a Littlewood-Richardson rule based on an algorithmic deformation of skew Young diagrams and present a bijection with the classical rule. The result is a direct combinatorial interpretation and proof of the geometric rule…
We study the Littlewood-Richardson coefficients of double Grothendieck polynomials indexed by Grassmannian permutations. Geometrically, these are the structure constants of the equivariant $K$-theory ring of Grassmannians. Representing the…
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$…
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 describe an explicit geometric Littlewood-Richardson rule, interpreted as deforming the intersection of two Schubert varieties so that they break into Schubert varieties. There are no restrictions on the base field, and all…
An introduction is given to the Littlewood-Richardson rule, and various combinatorial constructions related to it. We present a proof based on tableau switching, dual equivalence, and coplactic operations. We conclude with a section…
Littlewood Richardson coefficients are structure constants appearing in the representation theory of the general linear groups ($GL_n$). The main results of this paper are: 1. A strongly polynomial randomized approximation scheme for…
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$…
We develop structural insights into the Littlewood-Richardson graph, whose number of vertices equals the Littlewood-Richardson coefficient c({\lambda},{\mu},{\nu}) for given partitions {\lambda}, {\mu}, and {\nu}. This graph was first…
A theorem due to Tokuyama expresses Schur polynomials in terms of Gelfand-Tsetlin patterns, providing a deformation of the Weyl character formula and two other classical results, Stanley's formula for the Schur $q$-polynomials and Gelfand's…