Relating Edelman-Greene insertion to the Little map
Combinatorics
2013-01-15 v2
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.
Cite
@article{arxiv.1210.7119,
title = {Relating Edelman-Greene insertion to the Little map},
author = {Zachary Hamaker and Benjamin Young},
journal= {arXiv preprint arXiv:1210.7119},
year = {2013}
}
Comments
14 pages, 5 figures