Representation theory of finite semigroups, semigroup radicals and formal language theory
From MaRDI portal
Publication:3617621
DOI10.1090/S0002-9947-08-04712-0zbMath1185.20058arXivmath/0702400OpenAlexW2079502209MaRDI QIDQ3617621
Benjamin Steinberg, Jorge Almeida, Stuart W. Margolis, Mikhail V. Volkov
Publication date: 30 March 2009
Published in: Transactions of the American Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0702400
Jacobson radicalrepresentation theoryfinite semigroupsradicalssemigroup algebraslanguage theoryRhodes radical
Formal languages and automata (68Q45) Varieties and pseudovarieties of semigroups (20M07) Algebraic theory of languages and automata (68Q70) Semigroups in automata theory, linguistics, etc. (20M35) Semigroup rings, multiplicative semigroups of rings (20M25) Representation of semigroups; actions of semigroups on sets (20M30) Radical theory for semigroups (20M11)
Related Items
Quivers of monoids with basic algebras, The Černý conjecture and 1-contracting automata, THE AVERAGING TRICK AND THE ČERNÝ CONJECTURE, Semigroups of rectangular matrices under a sandwich operation, Groups and semigroups defined by colorings of synchronizing automata, Extensions of theorems of Gaschütz, Žmud\('\) and Rhodes on faithful representations, Effective dimension of finite semigroups., Face monoid actions and tropical hyperplane arrangements, The representation theory of the monoid of all partial functions on a set and related monoids as EI-category algebras., Idempotent elements of the endomorphism semiring of a finite chain., Preimage problems for deterministic finite automata, Some contributions to the theory of transformation monoids, John Rhodes and the theory of finite semigroups., Subsequence Counting, Matrix Representations and a Theorem of Eilenberg, Synchronizing Automata and the Černý Conjecture, Representation theory of finite semigroups over semirings., Turing machines and bimachines, Random walks on rings and modules, ALGEBRAIC CHARACTERIZATION OF LOGICALLY DEFINED TREE LANGUAGES, Möbius functions and semigroup representation theory. II: Character formulas and multiplicities., Theme and Variations on the Concatenation Product, Finding DFAs with Maximal Shortest Synchronizing Word Length, The quiver of an algebra associated to the Mantaci-Reutenauer descent algebra and the homology of regular semigroups., A bound for the length of the shortest reset words for semisimple synchronizing automata via the packing number, Černý's conjecture and group representation theory, Möbius functions and semigroup representation theory., The Černý conjecture for one-cluster automata with prime length cycle, Morita equivalence of finite semigroups, Semisimple Synchronizing Automata and the Wedderburn-Artin Theory, Slowly synchronizing automata with fixed alphabet size, Extremal synchronizing circular automata, Matrix Mortality and the Černý-Pin Conjecture, On the irreducible representations of a finite semigroup, An Algebraic Perspective on Boolean Function Learning, COMPLETELY REDUCIBLE SETS, Markov chains, ${\mathscr R}$-trivial monoids and representation theory, Maximal subgroups of free idempotent generated semigroups over the full linear monoid, Character theory of monoids over an arbitrary field.
Cites Work
- Categories as algebra: An essential ingredient in the theory of monoids
- Characterization of group radicals with an application to Mal'cev products.
- The kernel of monoid morphisms
- Locally trivial categories and unambiguous concatenation
- A generalization of the Schützenberger product of finite monoids
- Closure of varieties of languages under products with counter
- On pseudovarieties
- Sur le produit de concatenation non ambigu
- Operators on the lattice of pseudovarieties of finite semigroups
- Complex representations of finite monoids. II: Highest weight categories and quivers
- Synchronizing finite automata on Eulerian digraphs.
- Semigroups, rings, and Markov chains
- Linear algebraic monoids.
- Decomposition techniques for finite semigroups, using categories. I
- A combinatorial description of the spectrum for the Tsetlin library and its generalization to hyperplane arrangements
- Möbius functions and semigroup representation theory. II: Character formulas and multiplicities.
- Möbius functions and semigroup representation theory.
- Synchronizing groups and automata
- Complexity of finite semigroups
- Representations of semigroups by linear transformations. I
- Note on algebras
- On the structure of semigroups
- Combinatorics of Coxeter Groups
- SOME RESULTS ON ČERNÝ TYPE PROBLEMS FOR TRANSFORMATION SEMIGROUPS
- On two Combinatorial Problems Arising from Automata Theory
- The Jacobson radical of a band ring
- Complex Representations of Finite Monoids
- Sur le produit avec compteur modulo un nombre premier
- Semigroups and weights for group representations
- UNDECIDABILITY, AUTOMATA, AND PSEUDOVARITIES OF FINITE SEMIGROUPS
- The pseudovariety of semigroups of triangular matrices over a finite field
- On the extension problem for partial permutations
- A SYNTACTICAL PROOF OF LOCALITY OF DA
- On finite monoids having only trivial subgroups
- Characters and complexity of finite semigroups
- On finite 0-simple semigroups and graph theory
- A homomorphism theorem for finite semigroups
- Irreducible Matrix Representations of Finite Semigroups
- Studies in the Representation Theory of Finite Semigroups
- The radical of the algebra of any finite semigroup over any field
- Matrix Representations of Completely Simple Semigroups
- Reciprocity in character theory of finite semigroups
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
