Abstract
Enumeration and classification of mathematical entities is an important part of mathematical research in particular in finite algebra. For algebraic structures that are more general than groups this task is often only feasible by use of computers due to the sheer number of structures that have to be considered. In this paper we present the enumeration and partial classification of AG-groupoids - groupoids in which the identity (ab)c = (cb)a holds - of up to order 6. The results are obtained with the help of the computer algebra system GAP and the constraint solver Minion by making use of both algebraic techniques as well as search pruning via symmetry breaking. © 2011 Springer-Verlag.
Cite
CITATION STYLE
Distler, A., Shah, M., & Sorge, V. (2011). Enumeration of AG-groupoids. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6824 LNAI, pp. 1–14). Springer Verlag. https://doi.org/10.1007/978-3-642-22673-1_1
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
