On the enumeration of finite L-algebras

Loading...
Thumbnail Image

Journal Title

Journal ISSN

Volume Title

Publisher

American Mathematical Society

Abstract

We use Constraint Satisfaction Methods to construct and enumerate finite L-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 377,322,225 isomorphism classes of L-algebras of size eight. The database constructed suggests the existence of bijections between certain classes of L-algebras and well-known combinatorial objects. We prove that Bell numbers enumerate isomorphism classes of finite linear L-algebras. We also prove that finite regular L-algebras are in bijective correspondence with infinite-dimensional Young diagrams.

Description

Keywords

L-algebras, Computation, Universal algebra, Logic

Citation

Mathematics of Computation vol. 92, 2023, pp. 1363-1381.

Endorsement

Review

Supplemented By

Referenced By

Creative Commons license

Except where otherwised noted, this item's license is described as Attribution 4.0 Poland