Wreath product decompositions for triangular matrix semigroups
Mark Kambites (Universitaet Kassel), Benjamin Steinberg (Carleton, University)

TL;DR
This paper presents explicit wreath product decompositions for semigroups of upper triangular matrices, optimizing the decomposition for finite fields and extending results to more general rings and semirings.
Contribution
It provides a new explicit wreath product decomposition for triangular matrix semigroups, achieving optimality over finite fields and extending to broader algebraic structures.
Findings
Decomposition is optimal for finite fields.
Explicit wreath product decomposition for all upper triangular matrices.
Extensions to semigroups over general rings and semirings.
Abstract
We consider wreath product decompositions for semigroups of triangular matrices. We exhibit an explicit wreath product decomposition for the semigroup of all n-by-n upper triangular matrices over a given field k, in terms of aperiodic semigroups and affine groups over k. In the case that k is finite this decomposition is optimal, in the sense that the number of group terms is equal to the group complexity of the semigroup. We also obtain some decompositions for semigroups of triangular matrices over more general rings and semirings.
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 · Coding theory and cryptography · Computability, Logic, AI Algorithms
