Related papers: Identities and bases in the hypoplactic monoid

This paper presents new results on the identities satisfied by the sylvester and Baxter monoids. We show how to embed these monoids, of any rank strictly greater than 2, into a direct product of copies of the corresponding monoid of rank 2.…

We study the semigroup identities satisfied by finite rank plactic monoids. We find a new set of semigroup identities of the plactic monoid of rank $n$ for $n \geq 4$, which are shorter than those previously known when $n \geq 6$. Using…

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…

We exhibit a faithful representation of the plactic monoid of every finite rank as a monoid of upper triangular matrices over the tropical semiring. This answers a question first posed by Izhakian and subsequently studied by several…

This paper uses the combinatorics of Young tableaux to prove the plactic monoid of infinite rank does not satisfy a non-trivial identity, by showing that the plactic monoid of rank $n$ cannot satisfy a non-trivial identity of length less…

Up to isomorphism, there exist two non-isomorphic two-element monoids. We show that the identities of the free product of every pair of such monoids admit no finite basis.

This paper proves that a plactic monoid of any finite rank will have decidable first order theory. This resolves other open decidability problems about the finite rank plactic monoids, such as the Diophantine problem and identity checking.…

We exhibit a faithful representation of the stylic monoid of every finite rank as a monoid of upper unitriangular matrices over the tropical semiring. Thus, we show that the stylic monoid of finite rank $n$ generates the pseudovariety…

We study the equational theories and bases of meets and joins of several varieties of plactic-like monoids. Using those results, we construct sublattices of the lattice of varieties of monoids, generated by said varieties. We calculate the…

Let $\mathsf{mSt}_n$ be the plactic-like monoid obtained by factoring the free monoid over a finite alphabet $\mathcal{A}_n$ by the meet of the stalactic congruence and its dual. In this paper, we prove that $\mathsf{mSt}_n$ can be equipped…

We observe that for each $n\ge 2$, the identities of the stylic monoid with $n$ generators coincide with the identities of $n$-generated monoids from other distinguished series of $\mathscr{J}$-trivial monoids studied in the literature,…

It is shown that plactic monoids satisfy nontrivial identities.

In an earlier paper, the second-named author has described the identities holding in the so-called Catalan monoids. Here we extend this description to a certain family of Hecke--Kiselman monoids including the Kiselman monoids…

This paper considers whether non-trivial identities are satisfied by certain `plactic-like' monoids that, like the plactic monoid, are closely connected to combinatorics. New results show that the hypoplactic, sylvester, Baxter, stalactic,…

A limit variety is a variety that is minimal with respect to being non-finitely based. Since the turn of the millennium, much attention has been given to the classification of limit varieties of aperiodic monoids. Seven explicit examples…

In this paper we show that the membership problems for finitely generated submonoids and for rational subsets are recursively equivalent for groups with two or more ends.

We show how topological methods developed in a previous article can be applied to prove new results about topological and homological finiteness properties of monoids. A monoid presentation is called special if the right-hand side of each…

A monoid presentation is called special if the right-hand side of each defining relation is equal to 1. We prove results which relate the two-sided homological finiteness properties of a monoid defined by a special presentation with those…

We present a general method for proving that a semigroup is non-finitely based. The method is strong enough to cover the non-finite basis arguments in articles [1,3,4,5,7,8, 11,14,16,21,27,31,36,37]. In particular, the method allows to…

Over fields of characteristic unequal to $2$, we can identify symmetric matrices with homogeneous polynomials of degree $2$. This allows us to view symmetric rank-metric codes as living inside the space of such polynomials. In this paper,…