Related papers: Plactic monoids satisfy nontrivial identities

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,…

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…

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…

This paper presents new results on the identities satisfied by the hypoplactic monoid. We show how to embed the hypoplactic monoid of any rank strictly greater than 2 (including infinite rank) into a direct product of copies of the…

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 unknown so far, whether the lattice of all varieties of monoids satisfies some non-trivial identity. The objective of this note is to give the negative answer to this question. Namely, we prove that any finite lattice is a homomorphic…

We give an explicit presentation for the plactic monoid for type C using admissible column generators. Thanks to the combinatorial properties of symplectic tableaux, we prove that this presentation is finite and convergent. We obtain as a…

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…

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 note presents a proof that two principal ideals in a plactic monoid always intersect. Namely, this means that the plactic monoids are both left and right reversible. To the author's knowledge, this result has not yet appeared in the…

We present a new and useful congruence identity satisfied by m-permutable varieties.

In this paper, we study Novikov algebras satisfying nontrivial identities. We show that a Novikov algebra over a field of zero characteristic that satisfies a nontrivial identity satisfies some unexpected "universal" identities, in…

We study the four plactic-like monoids that arise by taking the meets and joins of stalactic and taiga congruences. We obtain the combinatorial objects associated with the meet monoids, establishing Robinson-Schensted-like correspondences…

We study mixed identities for oligomorphic automorphism groups of countable relational structures. Our main result gives sufficient conditions for such a group to not admit a mixed identity without particular constants. We study numerous…

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 lift to the multivariate Eulerian polynomials the identity implying that univariate Eulerian polynomials are palindromic. As a consequence of this generalization, we obtain nice combinatorial identities that can be directly extracted…

We compute the graded polynomial identities of the infinite dimensional upper triangular matrix algebra over an arbitrary field. If the grading group is finite, we prove that the set of graded polynomial identities admits a finite basis. We…

We give a transparent combinatorial characterization of the identities satisfied by the Kauffman monoid $\mathcal{K}_3$. Our characterization leads to a polynomial time algorithm to check whether a given identity holds in $\mathcal{K}_3$.

Motivated by recent advances in inverse semigroup theory, we investigate the growth of and identities satisfied by free left and free two-sided adequate monoids. We explicitly compute the growth of the monogenic free left adequate monoid…

We exhibit an example of a finitely presented monoid that is congruence-free and simple but not bisimple.