A constructive embedding of finite semigroups into smallish monoids reduces the aperiodic-flow test for Krohn-Rhodes complexity 1 to that smaller class.
Decidability of Krohn-Rhodes complexity $c = 1$ of finite semigroups and automata
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
abstract
When decomposing a finite semigroup into a wreath product of groups and aperiodic semigroups, complexity measures the minimal number of groups that are needed. Determining an algorithm to compute complexity has been an open problem for almost 60 years. The main result of this paper proves decidability of Krohn-Rhodes complexity $c = 1$ of finite semigroups and automata. This is achieved by showing the lower bounds in work by Henckell, Rhodes and Steinberg from 2012 is sharp using profinite methods and results of McCammond from 1991 and 2001.
fields
math.GR 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Aperiodic Flows on Finite Semigroups II: Smallish Monoids Suffice for Complexity 1
A constructive embedding of finite semigroups into smallish monoids reduces the aperiodic-flow test for Krohn-Rhodes complexity 1 to that smaller class.