Papers › On the enumeration of finite L-algebras
On the enumeration of finite L-algebras
C. Dietzel, P. Menchón, L. Vendramin
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
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 377322225 isomorphism classes of L-algebras of size eight. The database constructed suggest the existence of bijections between certain classes of L-algebras and well-known combinatorial objects. On the one hand, we prove that Bell numbers enumerate isomorphism classes of finite linear L-algebras. On the other hand, we also prove that finite regular L-algebras are in bijective correspondence with infinite-dimensional Young diagrams.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections