AbstractCoclass theory has been a highly successful approach towards the investigation and classification of finite nilpotent groups. Here we suggest a variation of this approach for finite nilpotent semigroups: we propose to study coclass graphs for the contracted semigroup algebras of nilpotent semigroups. We exhibit a series of conjectures on the shape of these coclass graphs. If these are proven, then this reduces the classification of nilpotent semigroups of a fixed coclass to a finite calculation. We show that our conjectures are supported by the nilpotent semigroups of coclass 0 and 1. Computational experiments suggest that the conjectures also hold for the nilpotent semigroups of coclass 2 and 3
The nilpotent conjugacy class graph (or NCC-graph) of a group $G$ is a graph whose vertices are the ...
AbstractIn “Semigroup Algebras,” Okniński posed the following question: characterize semigroup algeb...
We show Exel’s tight representation of an inverse semigroup can be described in terms of joins and c...
AbstractCoclass theory has been a highly successful approach towards the investigation and classific...
AbstractIt is shown that a semigroup S is finitely generated whenever the semigroup algebra K[S] is ...
The classification of finite semigroups is difficult even for small orders because of their large nu...
A finite semigroup is finitely related (has finite degree) if its term functions are determined by a...
In1987 Sullivan determined the elements of the semigroup N (X ) generated by all nilpotent partial t...
AbstractIn this paper we study sub-semigroups of a finite or an infinite zero-divisor semigroup S de...
We show that a number of natural membership problems for classes associated with finite semigroups a...
Using a variant of Schreier's Theorem, and the theory of Green's relations, we show how to reduce th...
This article is the abstract for the Ph.D. thesis of Subhrajyoti Saha. Doctor of Philosophy was awar...
Now that the conjectures of Leedham-Green and Newman have been proved, we probe deeper into the clas...
In 1980 Leedham-Green & Newman initialized the coclass theory, which has provided significant new in...
In semigroup theory there are certain kinds of band decompositions, which are very useful in the stu...
The nilpotent conjugacy class graph (or NCC-graph) of a group $G$ is a graph whose vertices are the ...
AbstractIn “Semigroup Algebras,” Okniński posed the following question: characterize semigroup algeb...
We show Exel’s tight representation of an inverse semigroup can be described in terms of joins and c...
AbstractCoclass theory has been a highly successful approach towards the investigation and classific...
AbstractIt is shown that a semigroup S is finitely generated whenever the semigroup algebra K[S] is ...
The classification of finite semigroups is difficult even for small orders because of their large nu...
A finite semigroup is finitely related (has finite degree) if its term functions are determined by a...
In1987 Sullivan determined the elements of the semigroup N (X ) generated by all nilpotent partial t...
AbstractIn this paper we study sub-semigroups of a finite or an infinite zero-divisor semigroup S de...
We show that a number of natural membership problems for classes associated with finite semigroups a...
Using a variant of Schreier's Theorem, and the theory of Green's relations, we show how to reduce th...
This article is the abstract for the Ph.D. thesis of Subhrajyoti Saha. Doctor of Philosophy was awar...
Now that the conjectures of Leedham-Green and Newman have been proved, we probe deeper into the clas...
In 1980 Leedham-Green & Newman initialized the coclass theory, which has provided significant new in...
In semigroup theory there are certain kinds of band decompositions, which are very useful in the stu...
The nilpotent conjugacy class graph (or NCC-graph) of a group $G$ is a graph whose vertices are the ...
AbstractIn “Semigroup Algebras,” Okniński posed the following question: characterize semigroup algeb...
We show Exel’s tight representation of an inverse semigroup can be described in terms of joins and c...