Abstract
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.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 229-240 |
| Number of pages | 12 |
| Journal | Discrete Mathematics and Theoretical Computer Science |
| State | Published - Nov 18 2013 |
| Event | 25th International Conference on Formal Power Series and Algebraic Combinatorics, FPSAC 2013 - Paris, France Duration: Jun 24 2013 → Jun 28 2013 |
Keywords
- Edelman-greene insertion
- Knuth moves
- Lascoux- schützenberger tree
- Reduced decompositions in the symmetric group
- Stanley symmetric functions
- Young tableaux