Merge decompositions, two-sided Krohn-Rhodes, and aperiodic pointlikes
Samuel J. v. Gool, Benjamin Steinberg

TL;DR
This paper introduces the merge decomposition technique to provide concise proofs of key theorems in finite semigroup theory, simplifying complex proofs and enabling new decompositions of semigroups.
Contribution
The paper presents a novel algebraic technique called merge decomposition, offering shorter proofs of the two-sided Krohn-Rhodes and Henckell's aperiodic pointlike theorems.
Findings
Simplified proofs of fundamental semigroup theorems
A new method for decomposing semigroups into components
Application of merge decomposition to semigroup homomorphisms
Abstract
This paper provides short proofs of two fundamental theorems of finite semigroup theory whose previous proofs were significantly longer, namely the two-sided Krohn-Rhodes decomposition theorem and Henckell's aperiodic pointlike theorem, using a new algebraic technique that we call the merge decomposition. A prototypical application of this technique decomposes a semigroup into a two-sided semidirect product whose components are built from two subsemigroups , which together generate , and the subsemigroup generated by their setwise product . In this sense we decompose by merging the subsemigroups and . More generally, our technique merges semigroup homomorphisms from free semigroups.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
Topicssemigroups and automata theory · Geometric and Algebraic Topology · Algorithms and Data Compression
