Enumerating left distributive groupoids
The goal is to compute the number of isomorphism types for left distributive groupoids of order \(n \leq 6\) (an LD-groupoid is a set with a binary operation that satisfies \(x(yz)=(xy)(xz)\)). It turns out that for \(n=6\) there are \(35\,527\,485\) iso types. To compute this number, the author generates all possible multiplication tables of LD-groupoids of order \(n\), and he proceeds in a lexicographical order. There are two benefits of such an approach: violations of the left distributivity can be found out before the table is completed, and a new iso type is recorded only when no isomorphic table is lexicographically smaller (and hence representatives of iso types need not be stored). To ease computational load the author has considered different cases separately according to the diagonal mapping, and this led him to a theorem that a finite zeropotent groupoid \(G\) (i.e. \(xx = 0\) for all \(x\in G\)) is left distributive if and only if \(x(yz) = 0\) for all \(x,y,z \in G\). He conjectured that this is not true in the infinite case. This conjecture has been recently proved by Patrick Dehornoy.
- A NORMAL FORM FOR THE FREE LEFT DISTRIBUTIVE LAW
- Construction of self-distributive operations and charged braids
- Finite left distributive algebras with one generator
- Finite Left Distributive Groupoids with one Generator
- scientific article; zbMATH DE number 638621 (Why is no real title available?)
- scientific article; zbMATH DE number 733089 (Why is no real title available?)
- Left-distributive idempotent algebras
- On the syntactic algorithm for the word problem of left distributivity
- The adjoint representation of left distributive structures
- The left distributive law and the freeness of an algebra of elementary embeddings
This page was built for publication: Enumerating left distributive groupoids
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4210014)
