Abstract
The free monoid on a finite totally ordered alphabet acts at the left on columns, by Schensted left insertion. This defines a finite monoid, denoted and called the stylic monoid. It is canonically a quotient of the plactic monoid. Main results are: the cardinality of is equal to the number of partitions of a set on elements. We give a bijection with so-called -tableaux, similar to Schensted's algorithm, explaining this fact. Presentation of : it is generated by subject to the plactic (Knuth) relations and the idempotent relations , . The canonical involutive anti-automorphism on , which reverses the order on , induces an involution of , which similarly to the corresponding involution of the plactic monoid, may be computed by an evacuation-like operation (Schützenberger involution on tableaux) on so-called standard immaculate tableaux (which are in bijection with partitions). The monoid is -trivial, and the -order of is graded: the co-rank is given by the number of elements in the -tableau. The monoid is the syntactic monoid for the the function which associates to each word the length of its longest strictly decreasing subword.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.