The semigroup of the homotopy classes of the self-homotopy maps of a finite complex which induce the trivial homomorphism on homotopy groups is nilpotent. We determine the nilpotency of these semigroups of compact Lie groups and finite Hopf spaces of rank 2. We also study the nilpotency of semigroups for Lie groups of higher rank. Especially, we give Lie groups with the nilpotency of the semigr...

The five-element Brandt semigroup B2 and its four-element subsemigroup B0, obtained by omitting one nonidempotent, have played key roles in the study of varieties of semigroups. Regarded in that fashion, they have long been known to be finitely based. The semigroup B2 carries the natural structure of an inverse semigroup. Regarded as such, in the signature {·,−1 }, it is also finitely based. It...

We investigate the class of quasitrivial semigroups and provide various characterizations of the subclass of quasitrivial and commutative semigroups as well as the subclass of quasitrivial and order-preserving semigroups. We also determine explicitly the sizes of these classes when the semigroups are defined on finite sets. As a byproduct of these enumerations, we obtain several new integer seq...

Geometric semigroup theory is the systematic investigation of finitely-generated semigroups using the topology and geometry of their associated automata. In this article we show how a number of easily-defined expansions on finite semigroups and automata lead to simplifications of the graphs on which the corresponding finite semigroups act. We show in particular that every finite semigroup can b...

THE concept of HNN-extensions of groups was introduced by Higman, Neumann and Neumann in 1949. HNN-extensions and amalgamated free products have played a crucial role in combinatorial group theory, especially for algorithmic problems. In inverse semigroup theory there are many ways of constructing HNNextension in order to ensure the embeddability of the original inverse semigroup in the new one...

We use ordered categories to study semidirect decompositions of finite ordered semigroups. We obtain ordered analogues of the derived category theorem and of the delay theorem. Next we prove that the ordered analogues of semilattices and of J -trivial monoids constitute local varieties, and we derive some decomposition theorems from these results. In [10], Pin and Weil initiated a study of the ...

In this paper we analyze the so called word-problem for (finite) combinatorial 0-simple semigroups and matrix semigroups from the viewpoint of computational complexity.

The results presented in this section are a good illustration of the following quotation of Marshall Stone [34]: ’A cardinal principle of modern mathematical research may be stated as a maxim: “One must always topologize” ’. Varieties of finite semigroups are a good example where Stone’s principle was applied successfully. Recall that a variety of semigroups is a class of semigroups closed unde...

The most important tool for classifying recognizable languages is Eilenberg’s variety theorem [1], which gives a one-to-one correspondence between (pseudo)-varieties of finite semigroups and varieties of recognizable languages. Varieties of recognizable languages are classes of recognizable languages closed under union, intersection, complement, left and right quotients and inverse morphisms. R...