Abstract
For a semigroup , the covering number of with respect to semigroups, , is the minimum number of proper subsemigroups of whose union is . This article investigates covering numbers of semigroups and analogously defined covering numbers of inverse semigroups and monoids. Our three main theorems give a complete description of the covering number of finite semigroups, finite inverse semigroups, and monoids (modulo groups and infinite semigroups). For a finite semigroup that is neither monogenic nor a group, its covering number is two. For all , there exists an inverse semigroup with covering number , similar to the case of loops. Finally, a monoid that is neither a group nor a semigroup with an identity adjoined has covering number two as well.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.