The Todd-Coxeter Algorithm for Semigroups and Monoids

Fuente: arXiv
Saved in:
Bibliographic Details
Main Authors: Coleman, T. D. H., Mitchell, J. D., Smith, F. L., Tsalakou, M.
Format: Preprint
Published: 2022
Subjects:
Online Access:
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866929267847200768
author Coleman, T. D. H.
Mitchell, J. D.
Smith, F. L.
Tsalakou, M.
author_facet Coleman, T. D. H.
Mitchell, J. D.
Smith, F. L.
Tsalakou, M.
contents 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.
format Preprint
id arxiv_https___arxiv_org_abs_2203_11148
institution arXiv
publishDate 2022
record_format arxiv
spellingShingle The Todd-Coxeter Algorithm for Semigroups and Monoids
Coleman, T. D. H.
Mitchell, J. D.
Smith, F. L.
Tsalakou, M.
Group Theory
Rings and Algebras
20M05, 20M30
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.
title The Todd-Coxeter Algorithm for Semigroups and Monoids
topic Group Theory
Rings and Algebras
20M05, 20M30
url https://arxiv.org/abs/2203.11148