Variation über ein Thema von Knuth, Robinson, Schensted und Schützenberger

Dieter Blessenohl and Armin Jöllenbeck
Additional contact information
Dieter Blessenohl: Christian-Albrechts-Universität zu Kiel, Mathematisches Seminar
Armin Jöllenbeck: Christian-Albrechts-Universität zu Kiel, Mathematisches Seminar

A chapter in Algebraic Combinatorics and Applications, 2001, pp 55-66 from Springer

Abstract: Abstract The crucial point of many approaches to representation theory of symmetric groups is the algorithm of Robinson and Schensted. Roughly speaking, this is a sorting algorithm with documentation. Prom the theorem of Schützenberger we take the idea for a description of the Robinson-Schensted correspondence without using the documentation part of the algorithm, which therefore plays no role in our approach. On the other hand we analyze the Knuth relations more thoroughly than usual. By means of a slight generalization of the sorting part of the algorithm we get another associative product on the free monoid X* over a countable alphabet X. The canonical map of X* onto the plactic monoid is also a homomorphism with respect to this product.

Keywords: Sorting Part; Countable Alphabet; Plactic Monoid; Documentation Part; Knuth Relation (search for similar items in EconPapers)
Date: 2001
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-642-59448-9_3

Ordering information: This item can be ordered from
http://www.springer.com/9783642594489

DOI: 10.1007/978-3-642-59448-9_3

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().