Enumerating Transformation Semigroups
classification
🧮 math.GR
keywords
semigroupstransformationenumeratingalgorithmicalgorithmsanti-isomorphismapplicationbase
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.