In mathematics, the Chinese monoid is a monoid generated by a totally ordered alphabet with the relations cba = cab = bca for every a ≤ b ≤ c. An algorithm similar to Schensted's algorithm yields characterisation of the equivalence classes and a . It was discovered by during their classification of monoids with growth similar to that of the plactic monoid, and studied in detail by Julien Cassaigne, Marc Espie, Daniel Krob, Jean-Christophe Novelli, and Florent Hivert in 2001. The Chinese monoid has a regular language cross-section and hence polynomial growth of dimension .
Attributes | Values |
---|
rdfs:label
| - Monoide xinès (ca)
- Chinese monoid (en)
|
rdfs:comment
| - En matemàtiques, un monoide xinès és un monoide generat per un alfabet totalment ordenat amb les relacions cba = cab = bca per cada a ≤ b ≤ c. El descrigueren durant la seva classificació de monoides amb creixement similar al del , i fou estudiat en detall per . (ca)
- In mathematics, the Chinese monoid is a monoid generated by a totally ordered alphabet with the relations cba = cab = bca for every a ≤ b ≤ c. An algorithm similar to Schensted's algorithm yields characterisation of the equivalence classes and a . It was discovered by during their classification of monoids with growth similar to that of the plactic monoid, and studied in detail by Julien Cassaigne, Marc Espie, Daniel Krob, Jean-Christophe Novelli, and Florent Hivert in 2001. The Chinese monoid has a regular language cross-section and hence polynomial growth of dimension . (en)
|
dcterms:subject
| |
Wikipage page ID
| |
Wikipage revision ID
| |
Link from a Wikipage to another Wikipage
| |
Link from a Wikipage to an external page
| |
sameAs
| |
dbp:wikiPageUsesTemplate
| |
has abstract
| - En matemàtiques, un monoide xinès és un monoide generat per un alfabet totalment ordenat amb les relacions cba = cab = bca per cada a ≤ b ≤ c. El descrigueren durant la seva classificació de monoides amb creixement similar al del , i fou estudiat en detall per . (ca)
- In mathematics, the Chinese monoid is a monoid generated by a totally ordered alphabet with the relations cba = cab = bca for every a ≤ b ≤ c. An algorithm similar to Schensted's algorithm yields characterisation of the equivalence classes and a . It was discovered by during their classification of monoids with growth similar to that of the plactic monoid, and studied in detail by Julien Cassaigne, Marc Espie, Daniel Krob, Jean-Christophe Novelli, and Florent Hivert in 2001. The Chinese monoid has a regular language cross-section and hence polynomial growth of dimension . The Chinese monoid equivalence class of a permutation is the preimage of an involution under the map where denotes the product in the Iwahori-Hecke algebra with . (en)
|
prov:wasDerivedFrom
| |
page length (characters) of wiki page
| |
foaf:isPrimaryTopicOf
| |
is Link from a Wikipage to another Wikipage
of | |
is foaf:primaryTopic
of | |