Representation Theory of Finite Semigroups, Semigroup Radicals and Formal Language Theory

Abstract

In this paper we characterize the congruence associated to the direct sum of all irreducible representations of a finite semigroup over an arbitrary field, generalizing results of Rhodes for the field of complex numbers. Applications are given to obtain many new results, as well as easier proofs of several results in the literature, involving: triangularizability of finite semigroups; which semigroups have (split) basic semigroup algebras, two-sided semidirect product decompositions of finite monoids; unambiguous products of rational languages; products of rational languages with counter; and Černý's conjecture for an important class of automata.

Cited by in corpus (16)

• Between primitive and $2$-transitive: Synchronization and its friends
• Quivers of monoids with basic algebras
• Maximal subgroups of free idempotent generated semigroups over the full linear monoid
• Primitive orthogonal idempotents for R-trivial monoids
• Markov chains, $\mathcal{R}$-trivial monoids and representation theory
• On the representation theory of finite J-trivial monoids
• Polymorphic Iterable Sequential Effect Systems
• Semigroups of rectangular matrices under a sandwich operation
• Groups and Semigroups Defined by Colorings of Synchronizing Automata
• Preimage problems for deterministic finite automata
• Excursions into Algebra and Combinatorics at $q=0$
• Yet another solution to the Burnside problem for matrix semigroups
• A bound for the shortest reset words for semisimple synchronizing automata via the packing number
• Random walks on rings and modules
• Slowly synchronizing automata with fixed alphabet size
• Cerny's conjecture, synchronizing automata, group representation theory