Complexity of Finite Semigroups: History and Decidability
Fuente:
arXiv
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866910769306664960 |
|---|---|
| author | Margolis, StuarT Rhodes, John Schilling, Anne |
| author_facet | Margolis, StuarT Rhodes, John Schilling, Anne |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2501_00770 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Complexity of Finite Semigroups: History and Decidability Margolis, StuarT Rhodes, John Schilling, Anne Group Theory 20M35, 20M20 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. |
| title | Complexity of Finite Semigroups: History and Decidability |
| topic | Group Theory 20M35, 20M20 |
| url | https://arxiv.org/abs/2501.00770 |