Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2406.18477 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866916302242709504 |
|---|---|
| author | Margolis, Stuart Rhodes, John Schilling, Anne |
| author_facet | Margolis, Stuart Rhodes, John Schilling, Anne |
| contents | The Krohn-Rhodes Theorem proves that a finite semigroup divides a wreath product of groups and aperiodic semigroups. Krohn-Rhodes complexity equals the minimal number of groups that are needed. Determining an algorithm to compute complexity has been an open problem for more than 50 years. The main result of this paper proves that it is decidable whether a semigroup has complexity k for any k greater than or equal to 0. This builds on our previous work for complexity 1. In that paper we proved using profinite methods and results on free Burnside semigroups by McCammond and others that the lower bound from a 2012 paper by Henckell, Rhodes and Steinberg is precise for complexity 1. In this paper we define an improved version of the lower bound from the 2012 paper and prove that it is exact for arbitrary complexity. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2406_18477 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Decidability of Krohn-Rhodes complexity for all finite semigroups and automata Margolis, Stuart Rhodes, John Schilling, Anne Group Theory 20M10, 20M20, 20M30, 20M35 The Krohn-Rhodes Theorem proves that a finite semigroup divides a wreath product of groups and aperiodic semigroups. Krohn-Rhodes complexity equals the minimal number of groups that are needed. Determining an algorithm to compute complexity has been an open problem for more than 50 years. The main result of this paper proves that it is decidable whether a semigroup has complexity k for any k greater than or equal to 0. This builds on our previous work for complexity 1. In that paper we proved using profinite methods and results on free Burnside semigroups by McCammond and others that the lower bound from a 2012 paper by Henckell, Rhodes and Steinberg is precise for complexity 1. In this paper we define an improved version of the lower bound from the 2012 paper and prove that it is exact for arbitrary complexity. |
| title | Decidability of Krohn-Rhodes complexity for all finite semigroups and automata |
| topic | Group Theory 20M10, 20M20, 20M30, 20M35 |
| url | https://arxiv.org/abs/2406.18477 |