For a semigroup $S$, the covering number of $S$ with respect to semigroups, $σ_s(S)$, is the minimum number of proper subsemigroups of $S$ whose union is $S$. 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 $n\geq 2$, there exists an inverse semigroup with covering number $n$, 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.
We associate a 2-complex to the following data: a presentation of a semigroup $S$ and a transitive action of $S$ on a set $V$ by partial transformations. The automorphism group of the action acts properly discontinuously on this 2-complex. A sufficient condition is given for the 2-complex to be simply connected. As a consequence we obtain simple topological proofs of results on presentations of Schützenberger groups. We also give a geometric proof that a finitely generated regular semigroup with finitely many idempotents has polynomial growth if and only if all its maximal subgroups are virtua…
We completely determine upper-modular, codistributive and costandard elements in the lattice of all commutative semigroup varieties. In particular, we prove that the properties of being upper-modular and codistributive elements in the mentioned lattice are equivalent. Moreover, in the nil-case the properties of being elements of all three types turn out to be equivalent.
We study varieties of semigroups related to completely 0-simple semigroup. We present here an algorithmic descriptions of these varieties interms of "forbidden" semigroups.
Two types of recurrence sets are introduced for inverse semigroup partial actions in topological spaces. We explore their connections with similar notions for related types of imperfect symmetries (prefix inverse semigroup expansions, partial group and groupoid actions).
We establish representation types (finite, tame or wild) of finite dimensional Munn algebras with semisimple bases. As an application, we establish representation types of finite 0-simple semigroups and their mutually annihilating unions.
The purpose of this paper is to study the generalization of inverse semigroups (without order). An ordered semigroup S is called an inverse ordered semigroup if for every a 2 S, any two inverses of a are H-related. We prove that an ordered semigroup is complete semilattice of t-simple ordered semigroups if and only if it is completely regular and inverse. Furthermore characterizations of inverse ordered semigroups have been characterized by their ordered idempotents.
We study varieties of semigroups related to completely 0-simple semigroup. We present here an algorithmic descriptions of these varieties in terms of "forbidden" semigroups. We also describe residually completely 0-simple varieties of semigroups in terms of identities.
A regular ordered semigroup $S$ is called right inverse if every principal left ideal of $S$ is generated by an $\mathcal{R}$-unique ordered idempotent. Here we explore the theory of right inverse ordered semigroups. We show that a regular ordered semigroup is right inverse if and only if any two right inverses of an element $a\in S$ are $\mathcal{R}$-related. Furthermore, different characterizations of right Clifford, right group-like, group like ordered semigroups are done by right inverse ordered semigroups. Thus a foundation of right inverse semigroups has been developed.
We investigate the question as to when the members of a finite regular semigroup may be permuted in such a way that each member is mapped to one of its inverses. In general this is not possible. However we reformulate the problem in terms of a related graph and, using an application of Hall's Marriage Lemma, we show in particular that the finite full transformation semigroup does enjoy this property.
A celebrated result of J. Thompson says that if a finite group $G$ has a fixed-point-free automorphism of prime order, then $G$ is nilpotent. The main purpose of this note is to extend this result to finite inverse semigroups. An earlier related result of B. H. Neumann says that a uniquely 2-divisible group with a fixed-point-free automorphism of order 2 is abelian. We similarly extend this result to uniquely 2-divisible inverse semigroups.
We use the description of the Schutzenberger automata for amalgams of finite inverse semigroups given by Cherubini, Meakin, Piochi to obtain structural results for such amalgams. Schutzenberger automata, in the case of amalgams of finite inverse semigroups, are automata with special structure possessing finite subgraphs, that contain all essential information related to the whole automaton. Using this crucial fact, and the Bass-Serre theory, we show that the maximal subgroups of an amalgamated free-product are either isomorphic to certain subgroups of the original semigroups or can be describe…
We study two classes of inverse semigroups built from directed graphs, namely graph inverse semigroups and a new class of semigroups that we refer to as Leavitt inverse semigroups. These semigroups are closely related to graph $C^*$-algebras and Leavitt path algebras. We provide a topological characterization of the universal groups of the local submonoids of these inverse semigroups. We study the relationship between the graph inverse semigroups of two graphs when there is a directed immersion between the graphs. We describe the structure of graphs that admit a directed cover or directed imme…
$E$-Ehresmann semigroups are a commonly studied generalization of inverse semigroups. They are closely related to Ehresmann categories in the same way that inverse semigroups are related to inductive groupoids. We prove that under some finiteness condition, the semigroup algebra of an $E$-Ehresmann semigroup is isomorphic to the category algebra of the corresponding Ehresmann category. This generalizes a result of Steinberg who proved this isomorphism for inverse semigroups and inductive groupoids and a result of Guo and Chen who proved it for ample semigroups. We also characterize $E$-Ehresma…
In this paper, we study algorithmic problems for automaton semigroups and automaton groups related to freeness and finiteness. In the course of this study, we also exhibit some connections between the algebraic structure of automaton (semi)groups and their dynamics on the boundary. First, we show that it is undecidable to check whether the group generated by a given invertible automaton has a positive relation, i.e. a relation p = 1 such that p only contains positive generators. Besides its obvious relation to the freeness of the group, the absence of positive relations has previously been stu…
We give a survey on results regarding self-similar and automaton presentations of free groups and semigroups and related products. Furthermore, we discuss open problems and results with respect to algebraic decision problems in this area.
We introduce the notion of semigroup with a tight ideal series and investigate their closures in semitopological semigroups, particularly inverse semigroups with continuous inversion. As a corollary we show that the symmetric inverse semigroup of finite transformations $\mathscr{I}_λ^n$ of the rank $\leqslant n$ is algebraically closed in the class of (semi)topological inverse semigroups with continuous inversion. We also derive related results about the nonexistence of (partial) compactifications of classes of semigroups that we consider.
