Selfdistributive groupoids of small orders

From MaRDI portal





By a groupoid is meant a nonempty set together with a binary, multiplicatively denoted operation. A groupoid is called left distributive if it satisfies the identity \(x(yz)=(xy)(xz)\). Right distributive groupoids are defined dually, and distributive groupoids are groupoids that are both left and right distributive. A groupoid is called medial if it satisfies the identity \((xy)(uv)=(xu)(yv)\). The authors prove the following theorem. If \(G\) is a non-medial distributive groupoid such that every proper subgroupoid of \(G\) is medial, then \(G\) is a quasigroup. As a consequence it follows that every non-medial distributive groupoid contains at least 81 elements.











This page was built for publication: Selfdistributive groupoids of small orders

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4209995)