The Edelman-Greene and Little correspondences
SPEAKER: Benjamin Young
TITLE: The Edelman-Greene and Little correspondences
ABSTRACT: I’ll discuss some recent joint work with Zach Hamaker. There are two bijections between families of reduced words in the symmetric group and sets of standard Young tableaux, due to Edelman-Greene and Little respectively. We showed that these bijections are the same.
The work is related to the Stanley symmetric functions, the Lascoux-Schutzenberger tree, random sorting networks, and other areas, but we don’t use those facts at all. The main insights were completely elementary and combinatorial, and in large part discovered by extensive computer experiments.