Abstract | ||
---|---|---|
This paper presents a combinatorial study of the Chinese monoid, a ternary monoid related to the plactic monoid and based on the relation scheme cba equivalent to bca equivalent to cab. An algorithm similar to Schensted's algorithm yields a characterization of the equivalence classes and a cross-section theorem. We also establish a Robinson-Schensted correspondence for the Chinese monoid before computing the order of specific Chinese classes. For this work, we had to develop some new combinatorial tools. Among other things we discovered an embedding of every equivalence class in the largest one. Finally, the end of this paper is devoted to the study of conjugacy classes. |
Year | DOI | Venue |
---|---|---|
2001 | 10.1142/S0218196701000425 | INTERNATIONAL JOURNAL OF ALGEBRA AND COMPUTATION |
Keywords | DocType | Volume |
cross section | Journal | 11 |
Issue | ISSN | Citations |
3 | 0218-1967 | 4 |
PageRank | References | Authors |
0.92 | 1 | 5 |
Name | Order | Citations | PageRank |
---|---|---|---|
Julien Cassaigne | 1 | 282 | 40.80 |
Marc Espie | 2 | 4 | 0.92 |
Daniel Krob | 3 | 340 | 44.90 |
Jean-christophe Novelli | 4 | 18 | 3.34 |
Florent Hivert | 5 | 47 | 9.63 |