Enumeration of finite inverse semigroups
Preprint
Abstract
We give an efficient algorithm for the enumeration up to isomorphism of the inverse semigroups of order n, and we count the number S(n) of inverse semigroups of order n<=15. This improves considerably on the previous highest-known value S(9). We also give a related algorithm for the enumeration up to isomorphism of the finite inverse semigroups S with a given underlying semilattice of idempotents E, a given restriction of Green's D-relation on S to E, and a given list of maximal subgroups of S associated to the elements of E.Keywords
All Related Versions
This publication has 5 references indexed in Scilit:
- Generating all finite modular lattices of a given sizeAlgebra universalis, 2015
- Practical graph isomorphism, IIJournal of Symbolic Computation, 2014
- The semigroups of order 9 and their automorphism groupsSemigroup Forum, 2013
- On the theory of inverse semigroups and generalized groups1979
- SWAC computes 126 distinct semigroups of order 4Proceedings of the American Mathematical Society, 1955