相关论文: Semigroup identities and varieties of plactic mono…

We study semigroup varieties generated by full and upper triangular tropical matrix semigroups and the plactic monoid of rank 4. We prove that the upper triangular tropical matrix semigroup $UT_n(\mathbb{T})$ generates a different semigroup…

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…

We prove the conjecture that, for any $n$, the monoid of all $n \times n$ tropical matrices satisfies nontrivial semigroup identities. To this end, we prove that the factor rank of a large enough power of a tropical matrix does not exceed…

We show that the submonoid of all nxn triangular tropical matrices satisfies a nontrivial semigroup identity and provide a generic construction for classes of such identities. The utilization of the Fibonacci number formula gives us an…

We give an alternative description of the grammic monoid in terms of weakly increasing subsequences. Specifically, we show that words $u,v$ in the generators $\{1,\ldots, n\}$ determine the same element of the grammic monoid of rank $n$ if…

We establish necessary and sufficient conditions for a semigroup identity to hold in the monoid of $n\times n$ upper triangular tropical matrices, in terms of equivalence of certain tropical polynomials. This leads to an algorithm for…

We prove that, for any $n$, the monoid of all $n \times n$ supertropical matrices extending tropical matrices satisfies nontrivial semigroup identities. These identities are carried over to walks on labeled-weighted digraphs with double…

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

The main result of the paper proves that the monoid of all 2 x 2 tropical matrices satisfies a non-trivial semigroup identity, unlike the case of matrices over infinite fields. We exploit a strong connection between the monoid of all 2 x 2…

We provide geometric methods and algorithms to verify, construct and enumerate pairs of words (of specified length over a fixed $m$-letter alphabet) that form identities in the semigroup $\ut{n}$ of $n\times n$ upper triangular tropical…

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 construct minimal and irredundant generating sets for a family of submonoids of the monoid of $n \times n$ upper triangular matrices over a commutative semiring. We show that the monoid of $n \times n$ matrices over the tropical…

It is shown that plactic monoids satisfy nontrivial identities.

A new tropical plactic algebra is introduced in which the Knuth relations are inferred from the underlying semiring arithmetics, encapsulating the ubiquitous plactic monoid $\mathcal{P}_n$. This algebra manifests a natural framework for…

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

We exhibit a 6-element semigroup that has no finite identity basis but nevertheless generates a variety whose finite membership problem admits a polynomial algorithm.

We establish a criterion for a semigroup identity to hold in the monoid of $n \times n$ upper unitriangular matrices with entries in a commutative semiring $S$. This criterion is combinatorial modulo the arithmetic of the multiplicative…

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