Related papers: On certain semigroups of finite oriented and order…
In this paper we study finite semiprimitive permutation groups, that is, groups in which each normal subgroup is transitive or semiregular. We give bounds on the order, base size, minimal degree, fixity, and chief length of an arbitrary…
We investigate the maximum length of a chain of subsemigroups in various classes of semigroups, such as the full transformation semigroups, the general linear semigroups, and the semigroups of order-preserving transformations of finite…
A fence is a particular partial order on a (finite) set, close to the linear order. In this paper, we calculate the rank of the semigroup $\mathcal{FI}_{n}$ of all order-preserving partial injections on an $n$-element fence. In particular,…
The rank of a finite semigroup is the smallest number of elements required to generate the semigroup. A formula is given for the rank of an arbitrary (non necessarily regular) Rees matrix semigroup over a group. The formula is expressed in…
Let $X$ be a finite set such that $|X|=n$, and let $k< n/2$. A group is $k$-homogeneous if it has only one orbit on the sets of size $k$. The aim of this paper is to prove some general results on permutation groups and then apply them to…
Let ${\cal I}_n$ be the symmetric inverse semigroup on $X_n = \{1, 2,..., n\}$ and let ${\cal DDP}_n$ and ${\cal ODDP}_n$ be its subsemigroups of order-decreasing partial isometries and of order-preserving order-decreasing partial…
Let $ \mathcal{I}_n$ be the symmetric inverse semigroup on $X_n = \{1, 2, \ldots , n\}$. Let $\mathcal{OCI}_n$ be the subsemigroup of $\mathcal{I}_n$ consisting of all order-preserving injective partial contraction mappings, and let…
K. S. S. Nambooripad intoduced nornal categories to enable to describe the structure of regular semigroups fully. In this paper we describe the ideal categories of the regular semigroup $OX_n,$ of non-invertible order-preserving…
This paper provides a bridge between two active areas of research, the spectrum (set of element orders) and the power graph of a finite group. The order sequence of a finite group $G$ is the list of orders of elements of the group, arranged…
In the present paper, a submonoid of the well studied monoid $POI_n$ of all order-preserving partial injections on an $n$-element chain is studied. The set $IOF_n^{par}$ of all partial transformations in $POI_n$ which are fence-preserving…
Let ${\cal T}_n$ be the full symmetric semigroup on $X_n = \{1, 2,..., n\}$ and let ${\cal OCT}_n$ and ${\cal ORCT}_n$ be its subsemigroups of order-preserving and order-preserving or order-reversing full contraction mappings of $X_n$,…
We introduce a new class of numerical semigroups, which we call the class of {\it acute} semigroups and we prove that they generalize symmetric and pseudo-symmetric numerical semigroups, Arf numerical semigroups and the semigroups generated…
We introduce the quasi-ordinarization transform of a numerical semigroup. This transform will allow to organize all the semigroups of a given genus in a forest rooted at all quasi-ordinary semigroups with the given genus. This construction…
In this article, we first prove that the type of an affine semigroup ring is equal to the number of maximal elements of the Ap\'ery set with respect to the set of exponents of the monomials, which form a maximal regular sequence. Further,…
A permutation group is called semiprimitive if each of its normal subgroups is either transitive or semiregular. Given nontrivial finite transitive permutation groups $L_1$ and $L_2$ with $L_1$ not semiprimitive, we construct an infinite…
The structure of transformation semigroups on a finite set is analyzed by introducing a hierarchy of functions mapping subsets to subsets. The resulting hierarchy of semigroups has a corresponding hierarchy of minimal ideals, or kernels.…
We obtain an asymptotic upper bound for the product of the $p$-parts of the orders of certain composition factors of a finite group acting completely reducibly and faithfully on a finite vector space of order divisible by a prime $p$. An…
There is strong evidence for the belief that `almost all' finite semigroups, whether we consider multiplication operations on a fixed set or their isomorphism classes, are nilpotent of index 3 (3-nilpotent for short). The only known method…
We describe general methods for enumerating subsemigroups of finite semigroups and techniques to improve the algorithmic efficiency of the calculations. As a particular application we use our algorithms to enumerate all transformation…
In this paper, we characterize completely the structure of Clifford semigroups of matrices over an arbitrary field. It is shown that a semigroups of matrices of finite order is a Clifford semigroup if and only if it is isomorphic to a…