Relating Edelman-Greene insertion to the Little map (Q472627): Difference between revisions

The Edelman-Greene insertion maps a reduced word \(w\) associated with a reduced expression of a permutation to a pair \((P(w),Q(w))\) of Young tableaux where the entries of \(P(w)\) are row-and-column strict and \(Q(w)\) is a standard Young tableau [\textit{P. Edelman} and \textit{C. Greene}, Adv. Math. 63, 42--99 (1987; Zbl 0616.05005)]. The Little bumps and Little map send a word \(w\) to a Grassmannian permutation and then to a standard tableau \(LS(w)\) [\textit{D. P. Little}, Adv. Math. 174, No. 2, 236--253 (2003; Zbl 1018.05102)]. In this paper, the authors show the Little map factors through the Edelman-Greene insertion. One of their main results shows that for a reduced word \(w\), \[ Q(w)=LS(w). \] They also show that for reduced words \(v\) and \(w\), \(w\) can be obtained from \(v\) by a sequence of Little bumps if and only if \(Q(v)=Q(w)\) and study a graph on the set of reduced words of a permutation.