We describe general methods for enumerating subsemigroups of finite semigroups and techniques to improve the algorithmic efficiency of the calculations. As a particular application we use our algorithms to enumerate all transformation semigroups up to degree 4. Classification of these semigroups up to conjugacy, isomorphism and anti-isomorphism, by size and rank, provides a solid base for further investigations of transformation semigroups.</p
If E is the set of idempotents and G the group of units within a full transformation semigroup F-X. ...
TEZ8337Tez (Doktora) -- Çukurova Üniversitesi, Adana, 2011.Kaynakça (s. 53) var.v, 55 s. ; 29 cm.Doğ...
We consider naturally occurring, uncountable transformation semigroups S and investigate the followi...
We describe general methods for enumerating subsemigroups of finite semigroups and techniques to imp...
We describe general methods for enumerating subsemigroups of finite semigroups and techniques to imp...
Abstract. We describe general methods for enumerating subsemigroups of finite semigroups and techniq...
This work was partially supported by the NeCTAR Research Cloud, an initiative of the Australian Gove...
The classification of finite semigroups is difficult even for small orders because of their large nu...
AbstractIn this paper an algorithm is presented that can be used to calculate the automorphism group...
The classification of finite semigroups is difficult even for small orders because of their large n...
In this paper an algorithm is presented that can be used to calculate the automorphism group of a fi...
Using a variant of Schreier's Theorem, and the theory of Green's relations, we show how to reduce th...
Using a variant of Schreier's Theorem, and the theory of Green's relations, we show how to reduce th...
AbstractThis paper describes algorithms for computing the structure of finite transformation semigro...
The Semigroups package is a GAP package containing methods for semigroups, monoids, and inverse semi...
If E is the set of idempotents and G the group of units within a full transformation semigroup F-X. ...
TEZ8337Tez (Doktora) -- Çukurova Üniversitesi, Adana, 2011.Kaynakça (s. 53) var.v, 55 s. ; 29 cm.Doğ...
We consider naturally occurring, uncountable transformation semigroups S and investigate the followi...
We describe general methods for enumerating subsemigroups of finite semigroups and techniques to imp...
We describe general methods for enumerating subsemigroups of finite semigroups and techniques to imp...
Abstract. We describe general methods for enumerating subsemigroups of finite semigroups and techniq...
This work was partially supported by the NeCTAR Research Cloud, an initiative of the Australian Gove...
The classification of finite semigroups is difficult even for small orders because of their large nu...
AbstractIn this paper an algorithm is presented that can be used to calculate the automorphism group...
The classification of finite semigroups is difficult even for small orders because of their large n...
In this paper an algorithm is presented that can be used to calculate the automorphism group of a fi...
Using a variant of Schreier's Theorem, and the theory of Green's relations, we show how to reduce th...
Using a variant of Schreier's Theorem, and the theory of Green's relations, we show how to reduce th...
AbstractThis paper describes algorithms for computing the structure of finite transformation semigro...
The Semigroups package is a GAP package containing methods for semigroups, monoids, and inverse semi...
If E is the set of idempotents and G the group of units within a full transformation semigroup F-X. ...
TEZ8337Tez (Doktora) -- Çukurova Üniversitesi, Adana, 2011.Kaynakça (s. 53) var.v, 55 s. ; 29 cm.Doğ...
We consider naturally occurring, uncountable transformation semigroups S and investigate the followi...
DOI
Add to ORKG