Publications

Export 2 results:
Sort by: Author [ Title  (Asc)] Type Year
A B C D E F G H I J K L M N O P Q [R] S T U V W X Y Z   [Show ALL]
R
A. J. Cain, M. Johnson, Kambites Malheiro M. A. "Representations and identities of plactic-like monoids." Journal of Algebra. 606 (2022): 819-850. AbstractWebsite

We exhibit faithful representations of the hypoplactic, stalactic, taiga, sylvester, Baxter and right patience sorting monoids of each finite rank as monoids of upper triangular matrices over any semiring from a large class including the tropical semiring and fields of characteristic 0. By analysing the image of these representations, we show that the variety generated by a single hypoplactic (respectively, stalactic or taiga) monoid of rank at least 2 coincides with the variety generated by the natural numbers together with a fixed finite monoid (respectively, F) and forms a proper subvariety of the variety generated by the plactic monoid of rank 2.

Cain, A. J., R. D. Gray, and A. Malheiro. "Rewriting systems and biautomatic structures for Chinese, hypoplactic, and sylvester monoids." Int. J. Algebra Comput.. 25 (2015): 51-80. AbstractWebsite

This paper studies complete rewriting systems and biautomaticity for three interesting classes of finite-rank homogeneous monoids: Chinese monoids, hypoplactic monoids, and sylvester monoids. For Chinese monoids, we first give new presentations via finite complete rewriting systems, using more lucid constructions and proofs than those given independently by Chen & Qui and Güzel Karpuz; we then construct biautomatic structures. For hypoplactic monoids, we construct finite complete rewriting systems and biautomatic structures. For sylvester monoids, which are not finitely presented, we prove that the standard presentation is an infinite complete rewriting system, and construct biautomatic structures. Consequently, the monoid algebras corresponding to monoids of these classes are automaton algebras in the sense of Ufnarovskij.