On the enumeration of finite -algebras
arXiv:2206.04955 · doi:10.1090/mcom/3814
Abstract
We use Constraint Satisfaction Methods to construct and enumerate finite -algebras up to isomorphism. These objects were recently introduced by Rump and appear in Garside theory, algebraic logic, and the study of the combinatorial Yang-Baxter equation. There are 377322225 isomorphism classes of -algebras of size eight. The database constructed suggest the existence of bijections between certain classes of -algebras and well-known combinatorial objects. On the one hand, we prove that Bell numbers enumerate isomorphism classes of finite linear -algebras. On the other hand, we also prove that finite regular -algebras are in bijective correspondence with infinite-dimensional Young diagrams.
17 pages, 3 tables, 2 figures. Postprint version