A presentation by generators and relations is given for the monoids of endomorphisms in the simplicial category. These monoids are submonoids of monoids one finds in Temperley-Lieb algebras, and as the monoids of Temperley-Lieb algebras are linked to situations where an endofunctor is adjoint to itself, so the monoids of simplicial endomorphisms axiomatized here are linked to arbitrary adjoint ...

A large class of multiplicative submonoids of the natural numbers is presented, which includes congruence monoids as well as numerical monoids (by isomorphism). For monoids in this class, the important factorization property of finite elasticity is characterized.

Free partially commutative inverse monoids are investigated. Analogously to free partially commutative monoids (trace monoids), free partially commutative inverse monoids are the quotients of free inverse monoids modulo a partially defined commutation relation on the generators. A quasi linear time algorithm for the word problem is presented, more precisely, we give an O(n log(n)) algorithm for...

Let M be a Krull monoid. Then every element of M may be written as a finite product of irreducible elements. If for every a ∈ M , each two factorizations of a have the same number of irreducible elements, then M is called half-factorial. Using a property of element exponentiation, we provide a new characterization of half-factoriality, valid for all Krull monoids whose class group has torsion-f...

This paper constructs presentations via finite complete rewriting systems for Plactic monoids of types An, Bn, Cn, Dn, and G2, using a unified proof strategy that depends on Kashiwara’s crystal bases and analogies of Young tableaux, and on Lecouvey’s presentations for these monoids. As corollaries, we deduce that Plactic monoids of these types have finite derivation type and satisfy the homolog...

Valence automata are a generalization of various models of automata with storage. Here, each edge carries, in addition to an input word, an element of a monoid. A computation is considered valid if multiplying the monoid elements on the visited edges yields the identity element. By choosing suitable monoids, a variety of automata models can be obtained as special valence automata. This work is ...

In this paper firt of all we introduce a generalization of torsion freeness of acts over monoids, called -torsion freeness. Then in section 1 of results we give some general properties and in sections 2, 3 and 4 we give a characterization of monoids for which this property of their right Rees factor, cyclic and acts in general  implies some other properties, respectively.

This paper deals with a connection between two decision problems for recognizable trace languages: the star problem and the nite power property problem. Due to a theorem by Richomme from 1994 26, 28], we know that both problems are decidable in trace monoids which do not contain a C4 submonoid. It is not known, whether the star problem or the nite power property are decidable in the C4 or in tr...

In this short note, we show that the number of monogenic submonoids full transformation monoid degree n for n>0, equals sum cyclic subgroups symmetric groups on 1 to points. We also prove an analogous statement subsemigroups finite monoids, as well inverse and monoids.