Abstract
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.
| Original language | English |
|---|---|
| Pages (from-to) | 109-125 |
| Number of pages | 17 |
| Journal | Semigroup Forum |
| Volume | 95 |
| Issue number | 1 |
| Early online date | 3 Apr 2017 |
| DOIs | |
| Publication status | Published - Aug 2017 |
Keywords
- Computational enumeration
- Ideal structure
- Multiplication table
- Transformation semigroup