activity
20232026
most citedDecidability of Krohn-Rhodes complexity for all finite semigroups and automata

1 citations · 2 across the 6 of their papers we have counts for

collaborators

8 papers

math.GR2026

The Margolis-Rhodes Monoid of a Graph

Stuart Margolis, John Rhodes

We investigate the structural, combinatorial, ideal-theoretic and Krohn-Rhodes complexity of the Margolis-Rhodes monoid, MR(G), of a finite simple graph G, viewed topologically as…

math.GR2026

Aperiodic Flows on Finite Semigroups II: Smallish Monoids Suffice for Complexity 1

Stuart Margolis, John Rhodes

A smallish monoid M is a monoid that has a unique 0-minimal ideal I(M) that is a 0-simple subsemigroup and such that its regular J -classes are the group of units and the two in I(…

math.GR2026

Bases of Permutation Groups and Boolean Representable Simplicial Complexes

Stuart Margolis, John Rhodes

A base of a permutation group (X,G) is a subset B of X such that its pointwise stabilizer is the trivial group. A list (x1,x2, ... ,xk) of elements of X is irredundant if each elem…

math.GR2025★ 1 cited

Master List of Examples in Complexity Theory of Finite Semigroup Theory

Stuart Margolis, John Rhodes

This document gives a list of finite semigroups that are interesting from the point of view of Krohn-Rhodes complexity theory. The list will be expanded and updates as "time goes b…

math.GR2025

Complexity of Finite Semigroups: History and Decidability

StuarT Margolis, John Rhodes, Anne Schilling

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. Th…

math.DS2024

Aperiodic Flows on Finite Semigroups: Foundations and First Examples

Stuart Margolis, John Rhodes

The theory of flows was used as a crucial tool in the recent proof by Margolis, Rhodes and Schilling that Krohn-Rhodes complexity is decidable. In this paper we begin a systematic…

math.GR2024★ 1 cited

Decidability of Krohn-Rhodes complexity for all finite semigroups and automata

Stuart Margolis, John Rhodes, Anne Schilling

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 tha…

math.CO2023

Topics in Boolean Representable Simplicial Complexes

Stuart Margolis, John Rhodes, Pedro V. Silva

We study a number of topics in the theory of Boolean Representable Simplicial Complexes (BRSC). These include various operators on BRSC. We look at shellability in higher dimension…