Related papers: An algorithmic Littlewood-Richardson rule
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…
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 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 give a survey on the Littlewood-Richardson rule. Using Gelfand-Tsetlin patterns as the main machinery of our analysis, we study the interrelationship of various combinatorial descriptions of the Littlewood-Richardson rule.
We give a positive equivariant Littlewood-Richardson rule also discovered independently by Molev. Our proof generalizes a proof by Stembridge of the ordinary Littlewood-Richardson rule. We describe a weight-preserving bijection between our…
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…
We present a library of formalized results around symmetric functions and the character theory of symmetric groups. Written in Coq/Rocq and based on the Mathematical Components library, it covers a large part of the contents of a graduate…
Let G be a semisimple algebraic group over an algebraically-closed field of characteristic zero. In this note we show that every regular face of the Littlewood-Richardson cone of G gives rise to a reduction rule: a rule which, given a…
We introduce a randomized Hall-Littlewood RSK algorithm and study its combinatorial and probabilistic properties. On the probabilistic side, a new model --- the Hall-Littlewood RSK field --- is introduced. Its various degenerations contain…
We present several direct bijections between different combinatorial interpretations of the Littlewood-Richardson coefficients. The bijections are defined by explicit linear maps which have other applications.
A numerical algorithm that computes the decomposition of any finite-dimen\-sio\-nal unitary reducible representation of a compact Lie group is presented. The algorithm, which does not rely on an algebraic insight on the group structure, is…
We study asymptotics of random shifted Young diagrams which correspond to a given sequence of reducible projective representations of the symmetric groups. We show limit results (Law of Large Numbers and Central Limit Theorem) for their…
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.
We give a new formula for the Littlewood--Richardson coefficients in terms of peelable tableaux compatible with shuffle tableaux, in the same fashion as Remmel--Whitney rule. This gives an efficient way to compute generalized…
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…
In this paper, we show how various combinatorial algorithms of Young tableaux naturally arise from the WKB approximation of the connection matrix of quantum confluent hypergeometric equation, including the Robinson-Schensted algorithm, the…
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…
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 classical Littlewood-Richardson coefficients C(lambda,mu,nu) carry a natural $S_3$ symmetry via permutation of the indices. Our "carton rule" for computing these numbers transparently and uniformly explains these six symmetries;…
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…