Relating Edelman-Greene insertion to the Little map
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.
- A pattern theorem for random sorting networks
- An extension of Schensted's theorem
- Asymptotic domino statistics in the Aztec diamond
- Balanced tableaux
- Combinatorial aspects of the Lascoux-Schützenberger tree
- Enumeration of permutations with prescribed up-down and inversion sequences
- Enumerative combinatorics. Volume 2.
- Factorization of the Robinson-Schensted-Knuth correspondence
- On the number of reduced decompositions of elements of Coxeter groups
- Plactification
- Quelques remarques sur une Construction de Schensted.
- Random sorting networks
- Random subnetworks of random sorting networks
- Schubert polynomials and the Littlewood-Richardson rule
- Perfect shuffling by lazy swaps
- Involution words: counting problems and connections to Schubert calculus for symmetric orbit closures
- A bijective proof of Macdonald's reduced word formula
- Bumping operators and insertion algorithms for queer supercrystals
- Hook formulas for skew shapes. IV: Increasing tableaux and factorial Grothendieck polynomials
- Random sorting networks: local statistics via random matrix laws
- Greene-Kleitman invariants for Sulzgruber insertion
- Lenart's bijection via bumpless pipe dreams
- Coxeter-Knuth graphs and a signed little map for type B reduced words
- The Archimedean limit of random sorting networks
- A bijective proof of Macdonald's reduced word formula
- Circular support in random sorting networks
- Relating Edelman-Greene insertion to the Little map
- Schur \(P\)-positivity and involution Stanley symmetric functions
- Properties of the Edelman-Greene bijection
- Properties of the Edelman-Greene bijection
- The oriented swap process and last passage percolation
This page was built for publication: Relating Edelman-Greene insertion to the Little map
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q472627)
