Complexity of Finite Semigroups: History and Decidability
Group Theory
2025-01-03 v1
Abstract
In recent papers, Margolis, Rhodes and Schilling proved that the complexity of a finite semigroup is computable. This solved a problem that had been open for more than 50 years. The purpose of this paper is to survey the basic results of Krohn-Rhodes complexity of finite semigroups and to outline the proof of its computability.
Keywords
Cite
@article{arxiv.2501.00770,
title = {Complexity of Finite Semigroups: History and Decidability},
author = {StuarT Margolis and John Rhodes and Anne Schilling},
journal= {arXiv preprint arXiv:2501.00770},
year = {2025}
}
Comments
arXiv admin note: text overlap with arXiv:2410.06668