Let R be a ring, M a right R-module and (S,≤) a strictly ordered monoid. In this paper we will show that if (S,≤) is a strictly ordered monoid satisfying the condition that 0 ≤ s for all s ∈ S, then the module [[MS,≤]] of generalized power series is a uniserial right [[RS,≤]] ]]-module if and only if M is a simple right R-module and S is a chain monoid.

In this paper $S$ is a monoid with a left zero and $A_S$ (or $A$) is a unitary right $S$-act. It is shown that a monoid $S$ is right perfect (semiperfect) if and only if every (finitely generated) strongly flat right $S$-act is quasi-projective. Also it is shown that if every right $S$-act has a unique zero element, then the existence of a quasi-projective cover for each right act implies that ...

we prove that if $m$ is a monoid and $a$ a finite set with more than one element‎, ‎then the residual finiteness of $m$ is equivalent to that of the monoid consisting of all cellular automata over $m$ with alphabet $a$‎.

let r be a ring, m a right r-module and (s,≤) a strictly ordered monoid. in this paper we will show that if (s,≤) is a strictly ordered monoid satisfying the condition that 0 ≤ s for all s ∈ s, then the module [[ms,≤]] of generalized power series is a uniserial right [[rs,≤]] ]]-module if and only if m is a simple right r-module and s is a chain monoid.

Finite monoids that generate monoid varieties with uncountably many subvarieties seem rare, and surprisingly, no finite monoid is known to generate a monoid variety with countably infinitely many subvarieties. In the present article, it is shown that there are, nevertheless, many finite monoids that generate monoid varieties with continuum many subvarieties; these include any finite inherently ...

The generators of the Temperley-Lieb algebra generate a monoid with an appealing geometric representation. It has been much studied, notably by Louis Kau¤man. Borisavljevíc, Došen and Petríc gave a complete proof of its abstract presentation by generators and relations, and suggested the name ‘Kau¤man monoid’. We bring the theory of semigroups to the study of a certain …nite homomorphic image o...

We define and study the Picard group of a monoid scheme and the class group of a normal monoid scheme. To do so, we develop some ideal theory for (pointed abelian) noetherian monoids, including primary decomposition and discrete valuations. The normalization of a monoid turns out to be a monoid scheme, but not always a monoid.

We prove that the endomorphism monoid of the infinite random graph R contains as a submonoid an isomorphic copy of each countable monoid. As a corollary, the monoid of R does not satisfy any non-trivial semigroup identity. We also prove that the full transformation monoid on a countably infinite set is isomorphic to a submonoid of the monoid of R.

In this paper, we introduce tripled partially ordered sets and monotone functions on tripled partiallyordered sets. Some basic properties on these new dened sets are studied and some examples forclarifying are given.