The Todd-Coxeter Algorithm for Semigroups and Monoids
Group Theory
2024-03-11 v2 Rings and Algebras
Abstract
In this paper we provide an account of the Todd-Coxeter algorithm for computing congruences on semigroups and monoids. We also give a novel description of an analogue for semigroups of the so-called Felsch strategy from the Todd-Coxeter algorithm for groups.
Cite
@article{arxiv.2203.11148,
title = {The Todd-Coxeter Algorithm for Semigroups and Monoids},
author = {T. D. H. Coleman and J. D. Mitchell and F. L. Smith and M. Tsalakou},
journal= {arXiv preprint arXiv:2203.11148},
year = {2024}
}
Comments
42 pages, 16 figures, 11 tables, updated according to referee's comments, to appear in Semigroup Forum