This work was partially supported by the NeCTAR Research Cloud, an initiative of the Australian Government’s Super Science scheme and the Education Investment Fund; and by the EU Project BIOMICS (Contract Number CNECT-ICT-318202).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.PostprintPeer reviewe
If E is the set of idempotents and G the group of units within a full transformation semigroup F-X. ...
Computational semigroup theory is concerned with developing and implementing algorithms for determin...
AbstractIn this paper an algorithm is presented that can be used to calculate the automorphism group...
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...
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...
The classification of finite semigroups is difficult even for small orders because of their large n...
The classification of finite semigroups is difficult even for small orders because of their large nu...
AbstractThis paper describes algorithms for computing the structure of finite transformation semigro...
A semigroup is simply a set with an associative binary operation; computational semigroup theory is ...
Computational semigroup theory involves the study and implementation of algorithms to compute with s...
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...
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. ...
Computational semigroup theory is concerned with developing and implementing algorithms for determin...
AbstractIn this paper an algorithm is presented that can be used to calculate the automorphism group...
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...
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...
The classification of finite semigroups is difficult even for small orders because of their large n...
The classification of finite semigroups is difficult even for small orders because of their large nu...
AbstractThis paper describes algorithms for computing the structure of finite transformation semigro...
A semigroup is simply a set with an associative binary operation; computational semigroup theory is ...
Computational semigroup theory involves the study and implementation of algorithms to compute with s...
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...
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. ...
Computational semigroup theory is concerned with developing and implementing algorithms for determin...
AbstractIn this paper an algorithm is presented that can be used to calculate the automorphism group...