MetaCartSign in to MyCiteSeer

Include Citations | Advanced Search | Help

Include Citations | Advanced Search | Help

  equivalence, jeu de taquin, and the Littlewood-Richardson rule [2 citations — 2 self]

Download:
pdf | ps
by Sergey Fomin
http://www.mathe2.uni-bayreuth.de/axel/papers/./fomin:knuth_equivalence_jeu_de_taquin_and_the_littlewood_richardson_rule.ps.gz
Add To MetaCart

Abstract:

This Appendix is devoted to the study of several combinatorial constructions involving standard Young tableaux (SYT) that lead to the proof of the Littlewood-Richardson rule, a combinatorial rule describing the coefficients in the Schur function expansion of an arbitrary skew Schur function (or in a product of two ordinary Schur functions). Most of what follows can be straightforwardly generalized to semistandard Young tableaux (SSYT). We do not do it here, in order to simplify the presentation. 1 Knuth equivalence and Greene's theorem The RSK correspondence w RSK \Gamma! (P; Q) associates to a permutation w 2 S n a pair of SYT: the insertion tableau P and the recording tableau Q; these tableaux have the same shape sh(w). In this section, we examine the following two questions: ffl What are the conditions for two permutations to have the same shape sh(w)? ffl What are the conditions for two permutations to have the same insertion tableaux P? The first question has an answer involving a particular family of poset-theoretic invariants of permutations. The equivalence relation appearing in the second question can be described in terms of certain elementary transformations that change three consecutive entries of a permutation. We first state these two results, and devote the rest of this section to their proof. For a permutation w = w 1 \Delta \Delta \Delta w n 2 S n and k 2 N, let I k = I k (w) denote the maximal number of elements in a union of k increasing subsequences of w. Analogously, let D l be the maximal size of a union of l decreasing subsequences of w. For example, for w = 236145 2 1

Citations

323 Symmetric Functions and Hall Polynomials – Macdonald - 1995
194 The Representation Theory of the Symmetric Groups – James, Kerber - 1981
147 Symmetric functions and – Macdonald - 1995
102 matrices, and generalized Young tableaux – Knuth, Permutations - 1970
100 The Symmetric Group: Representations, Combinatorial Algorithms, and Symmetric Functions,” 2nd edition – Sagan - 2001
98 Longest increasing and decreasing subsequences – Schensted - 1961
44 Young tableaux – Fulton - 1997
44 Questioning Representations – Robinson, Bannon - 1991
31 Le Monoid plaxique, Noncommutative structures – Lascoux, Schutzenberger - 1981
31 The Theory of Group Characters – Littlewood - 1950
30 An extension of Schensted’s theorem – Greene - 1974
30 The structure of Sperner k-families – Greene, Kleitman - 1976
30 Group characters and algebra – Littlewood, Richardson - 1934
30 Quelques remarques sur une construction de Schensted – Schützenberger - 1963
24 The generalized Robinson-Schensted-Knuth correspondence – Fomin - 1988
23 Zelevinsky,Triple multiplicities for sl(r+1) and the spectrum of the exterior algebra of the adjoint representation – Berenstein, A - 1992
23 Specht series for skew representations of symmetric groups – James, Peel - 1979
21 correspondance de Robinson, Combinatoire et Repr'esentation du Groupe Sym'etrique – La - 1977
19 A generalization of the Littlewood-Richardson rule and the RobinsonSchensted -Knuth correspondence – Zelevinsky - 1981
18 Some partitions associated with a partially ordered set – Greene - 1976
16 Promotion des morphismes d’ensembles ordonnés – Schutzenberger - 1972
12 A Littlewood-Richardson Miscellany – Fomin, Greene - 1993
8 On a construction of – Thomas - 1977
8 On Schensted's construction and the multiplication of Schur functions – Thomas - 1978
3 algebras and Schur functions – Thomas, Baxter - 1974