Finite and semisimple Boolean inverse monoids
Mark V. Lawson

TL;DR
This paper explores the structure of finite Boolean inverse monoids and extends the analysis to semisimple Boolean inverse semigroups, with implications for their representation theory.
Contribution
It provides a detailed structural description of finite Boolean inverse monoids and generalizes these results to semisimple cases, advancing the understanding of their algebraic properties.
Findings
Structural characterization of finite Boolean inverse monoids
Extension of results to semisimple Boolean inverse semigroups
Applications to the representation theory of finite inverse semigroups
Abstract
We describe the structure of finite Boolean inverse monoids and apply our results to the representation theory of finite inverse semigroups. We then generalize to semisimple Boolean inverse semigroups.
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 · Advanced Algebra and Logic · Rings, Modules, and Algebras
