A description of a class of finite semigroups that are near to being Malcev nilpotent
Abstract
In this paper we continue the investigations on the algebraic structure of a finite semigroup S that is determined by its associated upper non-nilpotent graph NS. The vertices of this graph are the elements of S and two vertices are adjacent if they generate a semigroup that is not nilpotent (in the sense of Malcev). We introduce a class of semigroups in which the Mal'cev nilpotent property lifts through ideal chains. We call this the class of \ semigroups. The definition is such that the global information that a semigroup is not nilpotent induces local information, i.e. some two-generated subsemigroups are not nilpotent. It turns out that a finite monoid (in particular, a finite group) is \ if and only if it is nilpotent. Our main result is a description of \ finite semigroups S in terms of their associated graph NS. In particular, S has a largest nilpotent ideal, say K, and S/K is a 0-disjoint union of its connected components (adjoined with a zero) with at least two elements.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.