The Little map and the Edelman–Greene insertion algorithm, a generalization of the Robinson–Schensted correspondence, are both used for enumerating the reduced decompositions of an element of the symmetric group. We show the Little map factors through Edelman–Greene insertion and establish new results about each map as a consequence. In particular, we resolve some conjectures of Lam and Little.
Bibliographical notePublisher Copyright:
© Springer Science+Business Media New York 2014.
Copyright 2015 Elsevier B.V., All rights reserved.
- Coxeter–Knuth move
- Dual equivalence
- Little map
- Reduced words
- Robinson–Schensted algorithm
- Sorting network
- Stanley symmetric functions