Results 171 to 180 of about 30,322 (203)
Some of the next articles are maybe not open access.
Semigroup Forum, 2002
The authors introduce and investigate a new class of monoids, called finitary monoids (here monoid means a commutative, cancellative semigroup with identity element). A monoid \(H\) (written multiplicatively) with group of invertible elements \(H^\times\) is called finitary if there is a finite subset \(U\subset H- H^\times\) such that \((H-H^\times)^n\
Geroldinger, Alfred +3 more
openaire +1 more source
The authors introduce and investigate a new class of monoids, called finitary monoids (here monoid means a commutative, cancellative semigroup with identity element). A monoid \(H\) (written multiplicatively) with group of invertible elements \(H^\times\) is called finitary if there is a finite subset \(U\subset H- H^\times\) such that \((H-H^\times)^n\
Geroldinger, Alfred +3 more
openaire +1 more source
Monoids, Krull Monoids, Large Monoids
2019In this chapter, we review what we will need in the rest of the book as far as commutative monoids are concerned. This will show how much we assume of the reader. The contents of Sections 1.5 and 1.7 are exceptions: they are completely independent of the rest of the chapter.
openaire +1 more source
Algebra universalis, 2011
The notion almost-Schreier monoid is introduced and investigated. Here, a monoid means a (multiplicative) commutative semigroup with \(1\) and \(0\), such that the semigroup without \(0\) is cancellative; an example to keep in mind is a domain when only multiplication is considered as operation.
Dumitrescu, Tiberiu, Khalid, Waseem
openaire +2 more sources
The notion almost-Schreier monoid is introduced and investigated. Here, a monoid means a (multiplicative) commutative semigroup with \(1\) and \(0\), such that the semigroup without \(0\) is cancellative; an example to keep in mind is a domain when only multiplication is considered as operation.
Dumitrescu, Tiberiu, Khalid, Waseem
openaire +2 more sources