Szakács Nóra
Finverse covers of Eunitary inverse monoids.
[Thesis]
(Unpublished)
Abstract in foreign language
The main motivation of the thesis is the socalled Finverse cover
problem. It asks whether every finite inverse monoid is a homomorphic image of a finite Finverse monoid. The problem was originally formulated by Henckell and Rhodes, and a positive answer would have solved an important conjecture connected to the complexity theory of finite semigroups. The latter conjecture has been since proven [2], but the Finverse cover problem has remained open. Significant progress has been made by Auinger and Szendrei in, where they have shown the Finverse cover problem to be equivalent to
a condition formulated by means of graphs and group varieties only. In the first part of the thesis, I investigate this condition, and establish that, if fixing the group variety, the graphs for which the condition is satisfied can be described using excluding minors. With this approach, as a main result, I give a full description of the graphs and group varieties satisfying it in the special case when the variety is Abelian.
As far as the originally proposed problem goes, these results of do not say much. However, they motivated the following problem: describe inverse monoids S which have an F
inverse cover F such that F/\sigma is an extension of an Abelian group by S/\sigma  this we
refer to as F being an Finverse cover via the variety of Abelian groups. The results in my thesis and those of Auinger and Szendrei combined characterize such inverse monoids which are also MargolisMeakin expansions.
In Chapter 4 of the thesis, I generalize the framework introduced by Auinger and Szendrei so that it "works" for a much larger class of inverse monoids called finiteabove Eunitary. In this framework, we obtain a
sufficient condition for an Eunitary finiteabove inverse monoid not to have an Finverse cover via the variety of Abelian groups, formulated by means of the natural partial order and the least group congruence.
Actions (login required)

View Item 