Wreath Product Decompositions for Triangular Matrix Semigroups
نویسندگان
چکیده
We consider wreath product decompositions for semigroups of triangular matrices. We exhibit an explicit wreath product decomposition for the semigroup of all n× 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.
منابع مشابه
Decompositions and complexity of linear automata
The Krohn-Rhodes complexity theory for pure (without lin-earity) automata is well-known. This theory uses an operation of wreath product as a decomposition tool. The main goal of the paper is to introduce the notion of complexity of linear automata. This notion is ultimately related with decompositions of linear automata. The study of these decom-positions is the second objective of the paper. ...
متن کاملWreath Decompositions of Finite Permutation Groups
There is a familiar construction with two finite, transitive permutation groups as input and a finite, transitive permutation group, called their wreath product, as output. The corresponding 'imprimitive wreath decomposition concept is the first subject of this paper. A formal definition is adopted and an overview obtained for all such decompositions of any given finite, transitive group. The r...
متن کاملPrime Decomposition Theorem for Arbitrary Semigroups: General Holonomy Decomposition and Synthesis Theorem
Herein we generalize the holonomy theorem for finite semigroups (see [7]) to arbitrary semigroups, S, by embedding s^ into an infinite Zeiger wreath product, which is then expanded to an infinite iterative matrix semigroup. If S is not finite-J-above (where finite-J-above means every element has only a finite number of divisors), then S is replaced by g3, the triple Schtitzenberger product, whi...
متن کاملSemidirect Products of Regular Semigroups
Within the usual semidirect product S ∗ T of regular semigroups S and T lies the set Reg (S ∗ T ) of its regular elements. Whenever S or T is completely simple, Reg (S ∗T ) is a (regular) subsemigroup. It is this ‘product’ that is the theme of the paper. It is best studied within the framework of existence (or e-) varieties of regular semigroups. Given two such classes, U and V, the e-variety U...
متن کاملAutomaton semigroup constructions
The aim of this paper is to investigate whether the class of automaton semigroups is closed under certain semigroup constructions. We prove that the free product of two automaton semigroups that contain left identities is again an automaton semigroup. We also show that the class of automaton semigroups is closed under the combined operation of ‘free product followed by adjoining an identity’. W...
متن کامل