Combinatorial aspects of the Lascoux-Schützenberger tree

DOI10.1016/S0001-8708(02)00038-5zbMath1018.05102WikidataQ29397075 ScholiaQ29397075MaRDI QIDQ1869992

David P. Little

Publication date: 4 May 2003

Published in: Advances in Mathematics (Search for Journal in Brave)

zbMATH Keywords

Littlewood-Richardson ruleStanley symmetric functionsLascoux-Schützenberger treereduced factorizations of symmetric group

Mathematics Subject Classification ID

Symmetric functions and generalizations (05E05)

Related Items (18)

Random sorting networks ⋮ Involution words: counting problems and connections to Schubert calculus for symmetric orbit closures ⋮ The Archimedean limit of random sorting networks ⋮ The oriented swap process and last passage percolation ⋮ Permutation patterns, Stanley symmetric functions, and generalized Specht modules ⋮ Lenart's bijection via bumpless pipe dreams ⋮ Coxeter-Knuth graphs and a signed little map for type B reduced words ⋮ Relating Edelman-Greene insertion to the Little map ⋮ A bijective proof of Macdonald's reduced word formula ⋮ Factorization of the Robinson-Schensted-Knuth correspondence ⋮ Transition formulas for involution Schubert polynomials ⋮ Unnamed Item ⋮ Bialgebras for Stanley symmetric functions ⋮ Circular support in random sorting networks ⋮ Properties of the Edelman-Greene bijection ⋮ Bumping operators and insertion algorithms for queer supercrystals ⋮ Schur $P$-positivity and Involution Stanley Symmetric Functions ⋮ A generalization of balanced tableaux and marriage problems with unique solutions

Cites Work

• Schubert polynomials and the Littlewood-Richardson rule
• On the number of reduced decompositions of elements of Coxeter groups
• Balanced tableaux
• Unnamed Item

This page was built for publication: Combinatorial aspects of the Lascoux-Schützenberger tree