Related papers: A new approach to the grammic monoid
Let $n$ be a positive integer $\geqslant 2$ and $\mathbb{N}^n_{\leqslant}$ be the $n$-th power of positive integers with the product order of the usual order on $\mathbb{N}$. In the paper we study the semigroup of injective partial monotone…
Let S=Sym(\Omega) be the group of all permutations of an infinite set \Omega. Extending an argument of Macpherson and Neumann, it is shown that if U is a generating set for S as a group, respectively as a monoid, then there exists a…
Let $\Gamma$ be the infinite cyclic group on a generator $x.$ To avoid confusion when working with $\mathbb Z$-modules which also have an additional $\mathbb Z$-action, we consider the $\mathbb Z$-action to be a $\Gamma$-action instead.…
The syntactic monoid of a language is generalized to the level of a symmetric monoidal closed category $\mathcal D$. This allows for a uniform treatment of several notions of syntactic algebras known in the literature, including the…
Convergent rewriting systems are well-known tools in the study of the word-rewriting problem. In particular, a presentation of a monoid by a finite convergent rewriting system gives an algorithm to decide the word problem for this monoid.…
We show that the rank r component of the free idempotent generated semigroup of the biordered set of the full linear monoid of n x n matrices over a division ring Q has maximal subgroup isomorphic to the general linear group GL_r(Q), where…
Given a connected simply connected semisimple group G and a connected spherical subgroup K we determine the generators of the extended weight monoid of G/K, based on the homogeneous spherical datum of G/K. Let H be a reductive subgroup of G…
We study the maximum multiplicity $\mathcal{M}(k,n)$ of a simple transposition $s_k=(k \: k+1)$ in a reduced word for the longest permutation $w_0=n \: n-1 \: \cdots \: 2 \: 1$, a problem closely related to much previous work on sorting…
In this article, we first prove that the type of an affine semigroup ring is equal to the number of maximal elements of the Ap\'ery set with respect to the set of exponents of the monomials, which form a maximal regular sequence. Further,…
The left patience sorting (lPS) monoid, also known in the literature as the Bell monoid, and the right patient sorting (rPS) monoid are introduced by defining certain congruences on words. Such congruences are constructed using insertion…
The language of maximal lexicographic representatives of elements in the positive braid monoid $A_n$ with $n$ generators is a regular language. We describe with great detail the smallest Finite State Automaton accepting such language, and…
The \emph{large rank} of a finite semigroup $\Gamma$, denoted by $r_5(\Gamma)$, is the least number $n$ such that every subset of $\Gamma$ with $n$ elements generates $\Gamma$. Howie and Ribeiro showed that $r_5(\Gamma) = |V| + 1$, where…
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.…
The syntactic monoid of a language is generalized to the level of a symmetric monoidal closed category D. This allows for a uniform treatment of several notions of syntactic algebras known in the literature, including the syntactic monoids…
We examine from an invariant theory viewpoint the monoid algebras for two monoids having large symmetry groups. The first monoid is the free left-regular band on $n$ letters, defined on the set of all injective words, that is, the words…
A large family of words must contain two words that are similar. We investigate several problems where the measure of similarity is the length of a common subsequence. We construct a family of n^{1/3} permutations on n letters, such that…
We construct the analogue of the plactic monoid for the super semistandard Young tableaux over a signed alphabet. This is done by developing a generalization of the Knuth's relations. Moreover we get generalizations of Greene's invariants…
In the free group $F_k$, an element is said to be primitive if it belongs to a free generating set. In this paper, we describe what a generic primitive element looks like. We prove that up to conjugation, a random primitive word of length…
Let $\beta\equiv\beta^{(2n)}$ be an N-dimensional real multi-sequence of degree 2n, with associated moment matrix $\mathcal{M}(n)\equiv \mathcal{M}(n)(\beta)$, and let $r:=rank \mathcal{M}(n)$. We prove that if $\mathcal{M}(n)$ is positive…
An $n$-length binary word is $q$-decreasing, $q\geq 1$, if every of its length maximal factor of the form $0^a1^b$ satisfies $a=0$ or $q\cdot a > b$.We show constructively that these words are in bijection with binary words having no…