A description of a class of finite semigroups that are near to being Malcev nilpotent

Mathematics – Group Theory

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Scientific paper

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 $\mathcal{N}_{S}$. 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 \B\ 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 \B\ if and only if it is nilpotent. Our main result is a description of \B\ finite semigroups $S$ in terms of their associated graph ${\mathcal N}_{S}$. 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.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

A description of a class of finite semigroups that are near to being Malcev nilpotent does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A description of a class of finite semigroups that are near to being Malcev nilpotent, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A description of a class of finite semigroups that are near to being Malcev nilpotent will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-488069

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.