Let $R$ be a unitary ring with an endomorphism $σ$ and $F∪{0}$ be the free monoid generated by $U={u_1,…,u_t}$ with $0$ added, and $M$ be a factor of $F$ setting certain monomial in $U$ to $0$, enough so that, for some natural number $n$, $M^n=0$. In this paper, we give a sufficient condition for a ring $R$ such that the skew monoid ring $R*M$ is quasi-Armendariz (By Hirano a ring $R$ is called...

— Relational morphisms betweenfinite monoids (a notion due to Tilson) are used to study the effect certain opérations on recognizabie sets have on the syntactic monoids ofthose sets. This leads to concise proofs ofa number ofknown results concerning the product opération, and a new resuit concerning the star opération. Résumé. — On utilise les morphismes relationnels (dus à Tilson) pour étudier...

We construct certain monoids, called tied monoids. These monoids result to be semidirect products finitely presented and commonly built from braid groups their relatives acting on of set partitions. The nature our indicate that they should give origin new knot algebras; indeed, include the monoid singular monoid, which were used, respectively, polynomial invariants for classical links links. Co...

This paper concerns the monoid Hecke algebras H introduced by Louis Solomon. We determine explicitly the unities of the orbit algebras associated with the two-sided action of the Weyl group W . We use this to: 1. find a description of the irreducible representations of H, 2. find an explicit isomorphism between H and the monoid algebra of the Renner monoid R, 3. extend the Kazhdan-Lusztig invol...

We investigate the relationship between regular languages and syntactic monoid size. In particular, we consider the transformation monoids of n-state (minimal) deterministic finite automata. We show tight upper bounds on the syntactic monoid size, proving that an nstate deterministic finite automaton with singleton input alphabet (input alphabet with at least three letters, respectively) induce...