Relating Edelman–Greene insertion to the Little map

Zachary Hamaker, Benjamin Young

Research output: Contribution to journalArticlepeer-review

11 Scopus citations

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.

Original languageEnglish (US)
Pages (from-to)693-710
Number of pages18
JournalJournal of Algebraic Combinatorics
Volume40
Issue number3
DOIs
StatePublished - Oct 2 2014

Bibliographical note

Publisher Copyright:
© Springer Science+Business Media New York 2014.

Copyright:
Copyright 2015 Elsevier B.V., All rights reserved.

Keywords

  • Coxeter–Knuth move
  • Dual equivalence
  • Edelman–Greene
  • Little map
  • Reduced words
  • Robinson–Schensted algorithm
  • Sorting network
  • Stanley symmetric functions

Fingerprint Dive into the research topics of 'Relating Edelman–Greene insertion to the Little map'. Together they form a unique fingerprint.

Cite this