zbMATH — the first resource for mathematics

Geometry Search for the term Geometry in any field. Queries are case-independent.
Funct* Wildcard queries are specified by * (e.g. functions, functorial, etc.). Otherwise the search is exact.
"Topological group" Phrases (multi-words) should be set in "straight quotation marks".
au: Bourbaki & ti: Algebra Search for author and title. The and-operator & is default and can be omitted.
Chebyshev | Tschebyscheff The or-operator | allows to search for Chebyshev or Tschebyscheff.
"Quasi* map*" py: 1989 The resulting documents have publication year 1989.
so: Eur* J* Mat* Soc* cc: 14 Search for publications in a particular source with a Mathematics Subject Classification code (cc) in 14.
"Partial diff* eq*" ! elliptic The not-operator ! eliminates all results containing the word elliptic.
dt: b & au: Hilbert The document type is set to books; alternatively: j for journal articles, a for book articles.
py: 2000-2015 cc: (94A | 11T) Number ranges are accepted. Terms can be grouped within (parentheses).
la: chinese Find documents in a given language. ISO 639-1 language codes can also be used.

a & b logic and
a | b logic or
!ab logic not
abc* right wildcard
"ab c" phrase
(ab c) parentheses
any anywhere an internal document identifier
au author, editor ai internal author identifier
ti title la language
so source ab review, abstract
py publication year rv reviewer
cc MSC code ut uncontrolled term
dt document type (j: journal article; b: book; a: book article)
The Chinese monoid. (English) Zbl 1024.20046
Summary: This paper presents a combinatorial study of the Chinese monoid, a ternary monoid related to the plactic monoid and based on the relation scheme cbabcacab. 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.

20M05Free semigroups, generators and relations, word problems
05E10Combinatorial aspects of representation theory
68R15Combinatorics on words