| Display title | Chinese monoid |
| Default sort key | Chinese monoid |
| Page length (in bytes) | 2,817 |
| Namespace ID | 0 |
| Page ID | 39536 |
| Page content language | en - English |
| Page content model | wikitext |
| Indexing by robots | Allowed |
| Number of redirects to this page | 0 |
| Counted as a content page | Yes |
| HandWiki item ID | None |
| Edit | Allow all users (infinite) |
| Move | Allow all users (infinite) |
| Page creator | imported>AnLinks |
| Date of page creation | 09:11, 27 June 2023 |
| Latest editor | imported>AnLinks |
| Date of latest edit | 09:11, 27 June 2023 |
| Total number of edits | 1 |
| Recent number of edits (within past 90 days) | 0 |
| Recent number of distinct authors | 0 |
Description | Content |
Article description: (description)
This attribute controls the content of the description and og:description elements. | 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 cross-section theorem. It was discovered by (Duchamp Krob... |
