On the enumeration of finite L-algebras

Repository of Nicolaus Copernicus University

Show simple item record

dc.contributor.author Menchon, Maria Paula
dc.contributor.author Dietzel, Carsten
dc.contributor.author Vendramin, Leandro
dc.date.accessioned 2023-03-02T07:48:55Z
dc.date.available 2023-03-02T07:48:55Z
dc.date.issued 2023-01-23
dc.identifier.citation Mathematics of Computation vol. 92, 2023, pp. 1363-1381.
dc.identifier.other https://doi.org/10.1090/mcom/3814
dc.identifier.uri http://repozytorium.umk.pl/handle/item/6832
dc.description.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.
dc.description.sponsorship National Science Center (Poland), grant number 2020/39/B/HS1/00216
dc.language.iso eng
dc.publisher American Mathematical Society
dc.rights Attribution-NonCommercial-NoDerivs 3.0 Poland
dc.rights.uri http://creativecommons.org/licenses/by-nc-nd/3.0/pl/
dc.subject L-algebras
dc.subject Computation
dc.subject Universal algebra
dc.subject Logic
dc.title On the enumeration of finite L-algebras
dc.type info:eu-repo/semantics/article

Files in this item

This item appears in the following Collection(s)

Show simple item record

Attribution-NonCommercial-NoDerivs 3.0 Poland Except where otherwise noted, this item's license is described as Attribution-NonCommercial-NoDerivs 3.0 Poland

Search repository

Advanced Search


My Account