 |
Discrete Mathematics & Theoretical Computer Science |
Zachary Hamaker ; Benjamin Young - Relating Edelman-Greene insertion to the Little map
dmtcs:12807 - Discrete Mathematics & Theoretical Computer Science, January 1, 2013, DMTCS Proceedings vol. AS, 25th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2013) - https://doi.org/10.46298/dmtcs.12807Relating Edelman-Greene insertion to the Little mapArticle
- 1 Department of Mathematics [Dartmouth]
- 2 Department of Mathematics, University of Oregon [Eugene]
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.
Source: HAL:hal-01229710v1
Volume: DMTCS Proceedings vol. AS, 25th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2013)
Section: Proceedings
Published on: January 1, 2013
Imported on: November 21, 2016
Keywords: Young tableaux,reduced decompositions in the symmetric group,Edelman-Greene insertion,Lascoux-Schützenberger tree,Knuth moves,Stanley symmetric functions,[INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]
Consultation statistics
This page has been seen 97 times.
This article's PDF has been downloaded 102 times.