相关论文: The Littlewood-Richardson rule and Gelfand-Tsetlin…

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…

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…

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…

The K-theoretic Littlewood-Richardson rule, established by A. Buch, is a combinatorial method for counting the structure constants involved in the product of two Grothendieck polynomials of Grassmannian type. In this paper, we provide an…

We give a closed formula of the Littlewood-Richardson coefficients.

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

We shall describe the one-to-one correspondence between the set of pictures and the set of Littlewood-Richardson crystals.

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…

The Littlewood-Richardson (LR) coefficient counts among many other things the LR tableaux of a given shape and a given content. We prove, that the number of LR tableaux weakly increases if one adds to the shape and the content the shape and…

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

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…

The Littlewood-Richardson coefficients describe the decomposition of tensor products of irreducible representations of a simple Lie algebra into irreducibles. Assuming the number of factors is large, one gets a measure on the space of…

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…

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…

We prove an identity for Littlewood--Richardson coefficients conjectured by Pelletier and Ressayre (arXiv:2005.09877). The proof relies on a novel birational involution defined over any semifield.

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…

We relate noncommutative Littlewood-Richardson coefficients of Bessenrodt-Luoto-van Willigenburg to classical Littlewood-Richardson coefficients via crystal reflection operators. A key role is played by the combinatorics of frank words.

The article describes the structural and algorithmic relations between Cartesian trees and Lyndon Trees. This leads to a uniform presentation of the Lyndon table of a word corresponding to the Next Nearest Smaller table of a sequence of…

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…