A theory of transformation monoids: combinatorics and representation theory

MaRDI QIDQ612950zbMATH OpenFDO

Authors Benjamin Steinberg

Publication date 16 December 2010

Published in The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1004.2982, https://eudml.org/doc/232740, http://www.emis.de/journals/EJC/Volume_17/Abstracts/v17i1r164.html

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

Markov chainsrepresentationsprojective coversfinite transformation monoidsorbital digraphsorbitalsprimitive transformation monoids

Mathematics Subject Classification ID

Semigroups of transformations, relations, partitions, etc. (20M20) Representation of semigroups; actions of semigroups on sets (20M30) Semigroups in automata theory, linguistics, etc. (20M35)

Abstract: The aim of this paper is to develop a theory of finite transformation monoids and in particular to study primitive transformation monoids. We introduce the notion of orbitals and orbital digraphs for transformation monoids and prove a monoid version of D. Higman's celebrated theorem characterizing primitivity in terms of connectedness of orbital digraphs. A thorough study of the module (or representation) associated to a transformation monoid is initiated. In particular, we compute the projective cover of the transformation module over a field of characteristic zero in the case of a transitive transformation or partial transformation monoid. Applications of probability theory and Markov chains to transformation monoids are also considered and an ergodic theorem is proved in this context. In particular, we obtain a generalization of a lemma of P. Neumann, from the theory of synchronizing groups, concerning the partition associated to a transformation of minimal rank.

Recommendations

• Some contributions to the theory of transformation monoids
• The global dimension of the full transformation monoid (with an appendix by V. Mazorchuk and B. Steinberg)
• Classical finite transformation semigroups. An introduction.
• Brauer characters of finite monoids.
• Representation theory of finite monoids

Cited in

(25)

• On automatic homeomorphicity for transformation monoids
• Primitivity, uniform minimality, and state complexity of Boolean operations
• Mitigating covert channels based on analysis of the potential for communication
• On clones, transformation monoids, and finite Boolean algebras.
• A local structure theorem for stable, \(\mathcal{J}\)-simple semigroup biacts
• Abelian networks. III: The critical group
• The global dimension of the full transformation monoid (with an appendix by V. Mazorchuk and B. Steinberg)
• One simple result concerning imprimitivity relations of monoids of transformations and its applications
• Generalized affine transformation monoids on Galois rings.
• A combinatorial description of the monoid of linkings.
• On the minimal faithful degree of Rhodes semisimple semigroups
• Abelian networks. II: Halting on all inputs
• Permutation monoids and MB-homogeneity for graphs and relational structures
• Primitive and irreducible automata
• Simplicity of augmentation submodules for transformation monoids
• Effective dimension of finite semigroups.
• Generalized affine transformation monoid of a free module of finite rank over finite chain rings.
• Character theory of monoids over an arbitrary field.
• Some contributions to the theory of transformation monoids
• A Burnside ring for monoids
• Hochschild cohomology of some finite category algebras as simplicial cohomology
• Abelian networks IV. Dynamics of nonhalting networks
• Dixon's theorem and random synchronization
• Reset thresholds of transformation monoids
• \(\aleph _0\)-categoricity of semigroups

This page was built for publication: A theory of transformation monoids: combinatorics and representation theory

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q612950)