Representation theory of finite monoids (Q303899)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Representation theory of finite monoids
scientific article

    Statements

    Representation theory of finite monoids (English)
    0 references
    0 references
    0 references
    22 August 2016
    0 references
    The notion `representation of a semigroup' has been used with different transformation semigroups, e.g. transformations of a set (semigroup acts); here representation is a homomorphism to the endomorphisms of a vector space -- a classical tool in group and ring theory used here to study finite monoids and semigroups. The presentation does not require knowledge of semigroup theory, but the module-theoretic presentation is a generalization of group representation theory thus the reader should have some knowledge of the latter and also of the theory of finite dimensional algebras The needed prior knowledge is presented (mostly without proofs) in 3 appendixes introducing finite dimensional algebras, group representations and Möbius inversion for posets. The book consists of 18 chapters which are presented in 7 parts. After 3 introductory chapters (Green relations, \(\mathcal{R}\)-trivial monoids, inverse monoids), Clifford-Munn-Ponizovskii theory of irreducible representations and character theory (Grothendick ring, character table, class functions) are presented. Part IV covers representations of inverse monoids and Part V (Bi-ideals) the Rhodes radical and triangularizability. In Part VI, three applications aregiven -- zeta function of languages (proving rationality of the zeta function of a cyclic regular language), transformation monoids, the Černý conjecture (with some new upper bounds for the reset word), Markov chains and random walks. Part VII presents advanced topics -- self-injective, Frobenius and symmetric algebras, the global dimension (here, some knowledge of homological algebras is required), quivers and connections with the theory of algebraic groups. The book is easy to follow. Every chapter begins with concise statement of the main result and ends with numerous exercises, thus it can be used as a textbook for advanced or post-graduate courses, but it is also of interest for all readers who enjoy clear algebraic text with numerous results.
    0 references
    0 references
    finite monoids
    0 references
    finite semigroups
    0 references
    representation
    0 references
    vector-space
    0 references
    endomorphisms
    0 references
    Markov chains
    0 references
    automata theory
    0 references
    combinatorics
    0 references
    zeta function
    0 references
    symbolic dynamics
    0 references
    synchronization problem
    0 references
    probability
    0 references
    Tsetlin library
    0 references
    Ehrenfest urn model
    0 references
    random walks
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references