In this paper a certain class of polyhedral semigroups which has a presentation $$ is examined‎. ‎The completeness of the presentation and solvability of word problem of this class of semigroups is determined‎. ‎Moreover the combinatorial distance between two words is determined‎.

In this paper we study sub-semigroups of a zero-divisor semigroup S determined by properties of the zero-divisor graph Γ(S). We use these sub-semigroups to study the correspondence between zero-divisor semigroups and zero-divisor graphs. We study properties of sub-semigroups of Boolean semigroups via the zero-divisor graph. As an application, we provide a characterization of the graphs which ar...

This paper is a survey of recent results in the theory of nite semigroups using syntactic techniques. This involves manipulating pseudoidentities and the study of relatively free proonite semigroups, whose structure encodes algebraic and combinatorial properties common to the members of a pseudovariety of semigroups. These techniques are illustrated with applications in the study of semigroups ...

We introduce the notion of pattern for numerical semigroups, which allows us to generalize the definition of Arf numerical semigroups. In this way infinitely many other classes of numerical semigroups are defined giving a classification of the whole set of numerical semigroups. In particular, all semigroups can be arranged in an infinite non-stabilizing ascending chain whose first step consists...

Even though the study and relevance of maximal embedding dimension numerical semigroups arises in a natural way among the other numerical semigroups, they have become specially renowned due to the existing applications to commutative algebra via their associated semigroup ring (see for instance [1, 5, 15, 16, 99, 100]). They are a source of examples of commutative rings with some maximal proper...

A ?semigroup is a semigroup whose lattice of congruences is a chain with respect to inclusion. Schein 9] and Tamura 11] have investigated commutative ?semigroups, Trotter 13] exponential, Nagy 4] weakly exponential and Bonzini and Cherubini Spoletini 2] nite ?semigroups. The pupose of the present paper is to investigate archimedean weakly commutative and H?commutative ?semigroups. 1 Weakly comm...

We generalize the character formulas for multiplicities of irreducible constituents from group theory to semigroup theory using Rota’s theory of Möbius inversion. The technique works for a large class of semigroups including: inverse semigroups, semigroups with commuting idempotents, idempotent semigroups and semigroups with basic algebras. Using these tools we are able to give a complete descr...

Let $S$ be an ordered semigroup. A fuzzy subset of $S$ is anarbitrary mapping   from $S$ into $[0,1]$, where $[0,1]$ is theusual interval of real numbers. In this paper,  the concept of fuzzygeneralized bi-ideals of an ordered semigroup $S$ is introduced.Regular ordered semigroups are characterized by means of fuzzy leftideals, fuzzy right ideals and fuzzy (generalized) bi-ideals.Finally, two m...

in 2005, a. abdollahi and a. rejali, studied the relations betweenparadoxical decomposition and configuration for semigroups. in thepresent paper, we introduce one other concept of amenability typeon semigroups and groups which includes amenability of semigroupsand inner-amenability of groups. we have extend the previous knownresults to semigroups and groups satisfying this concept.