Enumerating AG-monoids algebraically
Abstract
An AG-monoid is an AG-groupoid (a groupoid satisfying the identity called left invertive law (xy)z=(zy)x) and having a left identiy. In this paper we enumerate AG-monoids algebraically and then implement them in GAP to compute them computationally.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.