English

The Stylic Monoid

Combinatorics 2022-05-03 v2

Abstract

The free monoid AA^* on a finite totally ordered alphabet AA acts at the left on columns, by Schensted left insertion. This defines a finite monoid, denoted Styl(A)Styl(A) and called the stylic monoid. It is canonically a quotient of the plactic monoid. Main results are: the cardinality of Styl(A)Styl(A) is equal to the number of partitions of a set on A+1|A|+1 elements. We give a bijection with so-called NN-tableaux, similar to Schensted's algorithm, explaining this fact. Presentation of Styl(A)Styl(A): it is generated by AA subject to the plactic (Knuth) relations and the idempotent relations a2=aa^2=a, aAa\in A. The canonical involutive anti-automorphism on AA^*, which reverses the order on AA, induces an involution of Styl(A)Styl(A), which similarly to the corresponding involution of the plactic monoid, may be computed by an evacuation-like operation (Sch\"utzenberger involution on tableaux) on so-called standard immaculate tableaux (which are in bijection with partitions). The monoid Styl(A)Styl(A) is JJ-trivial, and the JJ-order of Styl(A)Styl(A) is graded: the co-rank is given by the number of elements in the NN-tableau. The monoid Styl(A)Styl(A) is the syntactic monoid for the the function which associates to each word wAw\in A^* the length of its longest strictly decreasing subword.

Keywords

Cite

@article{arxiv.2106.06556,
  title  = {The Stylic Monoid},
  author = {Antoine Abram and Christophe Reutenauer},
  journal= {arXiv preprint arXiv:2106.06556},
  year   = {2022}
}

Comments

43 pages, 24 figures

R2 v1 2026-06-24T03:06:52.221Z