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.