有限逆半群的Enumeration
Enumeration of finite inverse semigroups
摘要:
给出了n阶逆半群同构计数的一个有效算法,并计算了n ≤ 15阶逆半群的个数S(n).这大大改善了先前已知的最高值S(9)。我们还给出了有限逆半群S的同构计数的一个相关算法,其中S具有给定的幂等元半格E,S对E的Green D-关系的给定限制,以及S的与E的元素相联系的极大子群的给定列表。
英文摘要:
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.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。