Enumerating AG-monoids algebraically

preprint2026arXivOpen access

Abstract

An AG-monoid is an AG-groupoid (a groupoid satisfying the identity called left invertive law (xy)z=(zy)x(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.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.