Simplicity of augmentation submodules for transformation monoids
M.H. Shahzamanian, B. Steinberg

TL;DR
This paper explores the conditions under which augmentation submodules are simple in finite transformation monoids, extending known results from permutation groups and providing numerous natural examples.
Contribution
It characterizes finite transformation monoids with simple augmentation submodules over various fields, generalizing from permutation groups and including diverse natural examples.
Findings
Characterization of monoids with simple augmentation submodules
Extension of group results to monoids for fields like , , and
Examples include endomorphism monoids of complexes, posets, and graphs
Abstract
For finite permutation groups, simplicity of the augmentation submodule is equivalent to -transitivity over the field of complex numbers. We note that this is not the case for transformation monoids. We characterize the finite transformation monoids whose augmentation submodules are simple for a field (assuming the answer is known for groups, which is the case for , , and ) and provide many interesting and natural examples such as endomorphism monoids of connected simplicial complexes, posets, and graphs (the latter with simplicial mappings).
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
Topicssemigroups and automata theory · Geometric and Algebraic Topology · Algebraic structures and combinatorial models
