Related papers: On the Rees-Sushkevich variety
We study varieties of semigroups related to completely 0-simple semigroup. We present here an algorithmic descriptions of these varieties interms of "forbidden" semigroups.
A semigroup variety is said to be a Rees-Sushkevich variety if it is contained in a periodic variety generated by 0-simple semigroups. S. I. Kublanovsky has proven that a variety V is a Rees-Sushkevich variety if and only it does not…
We investigate classifications of quasitrivial semigroups defined by certain equivalence relations. The subclass of quasitrivial semigroups that preserve a given total ordering is also investigated. In the special case of finite semigroups,…
The common behaviour of many families of numerical semigroups led up to defining, firstly, the Frobenius varieties and, secondly, the (Frobenius) pseudo-varieties. However, some interesting families are still out of these definitions. To…
The most developed aspect of the theory of finite semigroups is their classification in pseudovarieties. The main motivation for investigating such entities comes from their connection with the classification of regular languages via…
We give a complete characterization of pseudovarieties of semigroups whose finitely generated relatively free profinite semigroups are equidivisible. Besides the pseudovarieties of completely simple semigroups, they are precisely the…
In an earlier work, the author observed that Boolean inverse semi-groups, with semigroup homomorphisms preserving finite orthogonal joins, form a congruence-permutable variety of algebras, called biases. We give a full description of…
We study the relationship between the loop problem of a semigroup, and that of a Rees matrix construction (with or without zero) over the semigroup. This allows us to characterize exactly those completely zero-simple semigroups for which…
For a reduced one-dimensional complete local $k$-algebra $R$, Huneke et al. (Res. Math. Sci., 8(4), paper no. 60, 2021) introduced an important invariant, the reduced type. In this article, we study the extremal behavior of reduced type of…
We begin a systematic study of finite semigroups that generate join irreducible members of the lattice of pseudovarieties of finite semigroups, which are important for the spectral theory of this lattice. Finite semigroups $S$ that generate…
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…
A semisimple element $s$ of a connected reductive group $G$ is said {\it quasi-isolated} (respectively {\it isolated}) if $C_G(s)$ (respectively $C_G^0(s)$) is not contained in a Levi subgroup of a proper parabolic subgroup of $G$. We study…
The structure of categorical at zero semigroups is studied from the point of view their likeness to categories.
This paper determines almost symmetric numerical semigroups with maximal reduced type completely. In addition, this paper classifies MED-semigroups with maximal reduced type.
In this paper, we provide a complete description of congruence-semisimple semirings and introduce the pre-ordered abelian Grothendieck groups $K_0(S)$ and $SK_0(S)$ of the isomorphism classes of the finitely generated projective and…
We consider various decision problems for automatic semigroups, which involve the provision of an automatic structure as part of the problem instance. With mild restrictions on the automatic structure, which seem to be necessary to make the…
Recent algorithmic advances in algebraic automata theory drew attention to semigroupoids (semicategories). These are mathematical descriptions of typed computational processes, but they have not been studied systematically in the context of…
We introduce a class of finite semigroups obtained by considering Rees quotients of numerical semigroups. Several natural questions concerning this class, as well as particular subclasses obtained by considering some special ideals, are…
In this paper, we study commutative zero-divisor semigroups determined by graphs. We prove a uniqueness theorem for a class of graphs. We show two classes of graphs that have no corresponding semigroups. In particular, any complete graph…
We present an algorithm to explore various properties of the numerical semigroups with a given maximum primitive. In particular, we count the number of such numerical semigroups and verify that there is no counterexample to Wilf's…