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 |
| DOIs | |
| Publication status | Published - 1 Aug 2017 |
Bibliographical note
Publisher Copyright:© 2017, Springer Science+Business Media New York.
Keywords
- algorithms
- multiplication
- semigroups