相关论文: A new approach to the grammic monoid

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

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

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

A group is Markov if it admits a prefix-closed regular language of unique representatives with respect to some generating set, and strongly Markov if it admits such a language of unique minimal-length representatives over every generating…

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…

A factorization of an element $x$ in a monoid $(M, \cdot)$ is an expression of the form $x = u_1^{z_1} \cdots u_k^{z_k}$ for irreducible elements $u_1, \ldots, u_k \in M$, and the length of such a factorization is $z_1 + \cdots + z_k$. We…

Let $(\mathsf{hypo}_n,~^\sharp)$ be the hypoplactic monoid of finite rank $n$ with Sch\"{u}tzenberger's involution $^{\sharp}$. In this paper, we exhibit a faithful representation of $(\mathsf{hypo}_n,~^\sharp)$ as an involution monoid of…

Two finite words $u$ and $v$ are $k$-binomially equivalent if, for each word $x$ of length at most $k$, $x$ appears the same number of times as a subsequence (i.e., as a scattered subword) of both $u$ and $v$. This notion generalizes…

For positive integers $u$ and $v$, let $L_u=\begin{bmatrix} 1 & 0 \\ u & 1 \end{bmatrix}$ and $R_v=\begin{bmatrix} 1 & v \\ 0 & 1 \end{bmatrix}$. Let $S_{u,v}$ be the monoid generated by $L_u$ and $R_v$, and $G_{u,v}$ be the group generated…

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…

Consider the full modular group $\sf{PSL}_{2}(\mathbb{Z})$ with presentation $\langle U,S|U^3,S^2\rangle$. Motivated by our investigations on quasi-modular forms and the Minkowski question mark function (so that this paper might be…

A special inverse monoid is one defined by a presentation where all the defining relations have the form $r = 1$. By a result of Ivanov Margolis and Meakin the word problem for such an inverse monoid can often be reduced to the word problem…

A prefix monoid is a finitely generated submonoid of a finitely presented group generated by the prefixes of its defining relators. Important results of Guba (1997), and of Ivanov, Margolis and Meakin (2001), show how the word problem for…

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…

Grammic monoids have recently been introduced by Christian Choffrut in terms of the action of the free monoid over a fixed ordered alphabet $X$ on the set of rows of Young tableaux filled with elements from $X$ via Schensted's insertion.…

The groups G_{k,1} of Richard Thompson and Graham Higman can be generalized in a natural way to monoids, that we call M_{k,1}, and to inverse monoids, called Inv_{k,1}; this is done by simply generalizing bijections to partial functions or…