Relating Edelman-Greene insertion to the Little map
From MaRDI portal
Recommendations
Cites work
- 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
Cited in
(17)- 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)