Abstract
We give an efficient 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. We then iterate over all possible combinations of these parameters to count the number S(n) of inverse semigroups of order n<=15. This improves considerably on the previous highest-known value S(9).

This publication has 7 references indexed in Scilit: