ON THE ENUMERATION OF FINITE L-ALGEBRAS

C. Dietzel, P. Menchón, L. Vendramin

Research output: Contribution to journalArticlepeer-review

17 Downloads (Pure)

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. © 2023 American Mathematical Society
Original languageEnglish
Pages (from-to)1363 - 1381
Number of pages19
JournalMathematics of Computation
Volume92
Issue number341
DOIs
Publication statusPublished - 2023

Bibliographical note

Funding Information:
Received by the editor June 15, 2022, and, in revised form, October 21, 2022, and November 14, 2022. 2020 Mathematics Subject Classification. Primary 03G25; Secondary 06D20. This research was supported through the program “Oberwolfach Research Fellows” by the Mathematisches Forschungsinstitut Oberwolfach in 2022. The second author was partially supported by the National Science Center (Poland), grant number 2020/39/B/HS1/00216. The third author was supported in part by OZR3762 of Vrije Universiteit Brussel.

Publisher Copyright:
© 2023 American Mathematical Society

Copyright:
Copyright 2023 Elsevier B.V., All rights reserved.

Fingerprint

Dive into the research topics of 'ON THE ENUMERATION OF FINITE L-ALGEBRAS'. Together they form a unique fingerprint.

Cite this