We describe maximal nilpotent subsemigroups of a given nilpotency class in the semigroup $Ω_n$ of all $n\times n$ real matrices with non-negative coefficients and the semigroup $\mathbf{D}_n$ of all doubly stochastic real matrices.
We develop a general approach to the study of maximal nilpotent subsemigroups of finite semigroups. This approach can be used to recover many known classifications of maximal nilpotent subsemigroups, in particular, for the symmetric inverse semigroup, the symmetric semigroup, and the factor power of the symmetric group. We also apply this approach to obtain a classification of maximal nilpotent subsemigroups in the semigroup of binary relations and in certain 0-simple finite semigroups.
We prove that the semigroup generated by a reversible Mealy automaton contains a free subsemigroup of rank two if and only if it contains an element of infinite order.
For an element a in a semigroup S the local subsemigroup of S with respect to a is the subsemigroup aSa of S and the variant of S with respect to a is a semigroup with underlying set S with a sandwich operation xy = xay for all x, y in S. In this paper we discuss the structures of local subsemigroups of full transformation semigroups and symmetric inverse monoids. It is also shown that the set of all local subsemigroups of finite symmetric inverse monoids and the set of all variants of all finite symmetric inverse monoids are same upto isomorphism.
This paper studies automatic structures for subsemigroups of Baumslag--Solitar semigroups (that is, semigroups presented by $\ < x,y \mid (yx^m, x^ny)\ >$, where $m$ and $n$ are natural numbers). A geometric argument (a rarity in the field of automatic semigroups) is used to show that if $m \gt n$, all of the finitely generated subsemigroups of this semigroup are [right-] automatic. If $m \lt n$, all of its finitely generated subsemigroups are left-automatic. If $m = n$, there exist finitely generated subsemigroups that are not automatic. An appendix discusses the implications of these results…
As part of his study of representations of the polycylic monoids, M.V. Lawson described all the closed inverse submonoids of a polycyclic monoid $P_n$ and classified them up to conjugacy. We show that Lawson's description can be extended to closed inverse subsemigroups of graph inverse semigroups. We then apply B. Schein's theory of cosets in inverse semigroups to the closed inverse subsemigroups of graph inverse semigroups: we give necessary and sufficient conditions for a closed inverse subsemigroup of a graph inverse semigroup to have finite index, and determine the value of the index when …
A semigroup is \emph{amiable} if there is exactly one idempotent in each $\mathcal{R}^*$-class and in each $\mathcal{L}^*$-class. A semigroup is \emph{adequate} if it is amiable and if its idempotents commute. We characterize adequate semigroups by showing that they are precisely those amiable semigroups which do not contain isomorphic copies of two particular nonadequate semigroups as subsemigroups.
In this paper, we consider the following problem: For every positive integer $r \geq 2$, find all positive integers $n$ such that for every semigroup of order $\geq n$ in which $x^r=x$ for every element $x$ has a subsemigroup of order $n$.
Ideal series of semigroups play an important role in the examination of semigroups which have proper two-sided ideals. But the corresponding theorems cannot be used when left simple (or right simple or simple) semigroups are considered. So it is a natural idea that we try to use the group theoretical methods (instead of the ring theoretical ones) for the examination of these semigroups. The purpose of this paper is to find a suitable type of subsemigroups of left simple semigroups which makes possible for us to generalize some notions (the notion of the normal series and the composition series…
Every semigroup which is a finite disjoint union of copies of the free mono- genic semigroup (natural numbers under addition) has soluble word prob- lem and soluble membership problem. Efficient algorithms are given for both problems.
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 chains. In some cases, we give lower bounds for the total number of subsemigroups of these semigroups. We give general results for finite completely regular and finite inverse semigroups. Wherever possible, we state our results in the greatest generality; in particular, we include infinite semigroups where the result is true for these. The length of a subgroup c…
The direct product $\mathbb{N}\times\mathbb{N}$ of two free monogenic semigroups contains uncountably many pairwise non-isomorphic subdirect products. Furthermore, the following hold for $\mathbb{N}\times S$, where $S$ is a finite semigroup. It contains only countably many pairwise non-isomorphic subsemigroups if and only if $S$ is a union of groups. And it contains only countably many pairwise non-isomorphic subdirect products if and only if every element of $S$ has a relative left- or right identity element.
Let $[n]=\{1,\ldots,n\}$ be the $n$-chain. We give presentations for the following transformation semigroups: the semigroup of full order-decreasing mappings of $[n]$, the semigroup of partial one-to-one order-decreasing mappings of $[n]$, the semigroup of full order-preserving and order-decreasing mappings of $[n]$, the semigroup of partial one-to-one order-preserving and order-decreasing mappings of $[n]$, and the semigroup of partial order-preserving and order-decreasing mappings of $[n]$.
All isolated, completely isolated, and nilpotent subsemigroups in the semigroup $\IS$ of all injective partial transformations of an $n$-element set, considered as a semigroup with a sandwich multiplication are described.
If a finitely generated semigroup S has a hopfian (meaning: every surjective endomorphism is an automorphism) cofinite subsemigroup T then S is hopfian too. This no longer holds if S is not finitely generated. There exists a finitely generated hopfian semigroup S with a non-hopfian subsemigroup T such that S\T has size 1.
In this paper we study ends of finitely generated semigroups. The ends we are working with are the ends of the undirected graphs of Cayley graphs of finitely generated semigroups. We prove that the number of ends is preserved for subsemigroups of finite Rees index, and prove the same result for finite Green index subsemigroups of cancellative semigroups.
We classify all isolated, completely isolated, and convex subsemigroups in the semigroup T_n of all transformations of an n-element set, considered as the semigroup with respect to a sandwich operation.
We study the structure of nilpotent subsemigroups in the semigroup $M(n,\mathbb{F})$ of all $n\times n$ matrices over a field, $\mathbb{F}$, with respect to the operation of the usual matrix multiplication. We describe the maximal subsemigroups among the nilpotent subsemigroups of a fixed nilpotency degree and classify them up to isomorphism. We also describe isolated and completely isolated subsemigroups and conjugated elements in $M(n,\mathbb{F})$.
The index of a subgroup of a group counts the number of cosets of that subgroup. A subgroup of finite index often shares structural properties with the group, and the existence of a subgroup of finite index with some particular property can therefore imply useful structural information for the overgroup. A developed theory of cosets in inverse semigroups exists, originally due to Schein: it is defined only for closed inverse subsemigroups, and the structural correspondences between an inverse semigroup and a closed inverse subsemigroup of finite index are weaker than in the group case. Neverth…
Two semigroups are lattice isomorphic if the lattices of their subsemigroups are isomorphic, and a class of semigroups is lattice closed if it contains every semigroup which is lattice isomorphic to some semigroup from that class. An orthodox semigroup is a regular semigroup whose idempotents form a subsemigroup. We prove that the class of all orthodox semigroups in which every nonidempotent element has infinite order is lattice closed.
Let $\mathcal{CT}_n$ be the semigroup of full contraction mappings on $[n]=\{1,2,\ldots,n\}$, and let $\mathcal{OCT}_n$ and $\mathcal{ODCT}_n$ be the subsemigroups consisting of all order-preserving full contraction and subsemigroup of order-decreasing and order-preserving full contraction mappings, respectively. In this paper, we show that the semigroup $\mathcal{ODCT}_n$ is left adequate. We further study the rank properties and as well obtain the rank of the semigroup, $\mathcal{ODCT}_n$. Moreover, we obtain a characterization of natural partial order for the semigroup $\mathcal{OCT}_n$ and…
We study maximal subsemigroups of the monoid T(X) of all full transformations on the set X=N of natural numbers containing a given subsemigroup W of T(X) where each element of a given set $U$ is a generator of T(X) modulo W. This note continue the study of maximal subsemigroups on the monoid of all full transformations on a infinite set.
Let $T(X)$ (resp. L(V)) be the semigroup of all transformations (resp. linear transformations) of a set $X$ (resp. vector space $V$). For a subset $Y$ of $X$ and a subsemigroup $\mathbb{S}(Y)$ of $T(Y)$, consider the subsemigroup $T_{\mathbb{S}(Y)}(X) = \{f\in T(X)\colon f_{\upharpoonright_Y} \in \mathbb{S}(Y)\}$ of $T(X)$, where $f_{\upharpoonright_Y}\in T(Y)$ agrees with $f$ on $Y$. We give a new characterization for $T_{\mathbb{S}(Y)}(X)$ to be a regular semigroup [inverse semigroup]. For a subspace $W$ of $V$ and a subsemigroup $\mathbb{S}(W)$ of $L(W)$, we define an analogous subsemigroup…
In this paper we introduce a new notion by the help of the idealizer. This new notion is the separator of a subset of a semigroup. We investigate the properties of the separator in an arbitrary semigroup and characterize the unitary subsemigroups and the prime ideals by the help of their separator. The last section of this paper treats the separator of a free subsemigroup of a free semigroup.
Using Rees index, the subsemigroup growth of free semigroups is investigated. Lower and upper bounds for the sequence are given and it is shown to have superexponential growth of strict type $n^n$ for finite free rank greater than 1. It is also shown that free semigroups have the fastest subsemigroup growth of all finitely generated semigroups. Ideal growth is shown to be exponential with strict type $2^n$ and congruence growth is shown to be at least exponential. In addition we consider the case when the index is fixed and rank increasing, proving that for subsemigroups and ideals this sequen…
We investigate four finiteness conditions related to residual finiteness: complete separability, strong subsemigroup separability, weak subsemigroup separability and monogenic subsemigroup separability. For each of these properties we examine under which conditions the property is preserved under direct products. We also consider if any of the properties are inherited by the factors in a direct product. We give necessary and sufficient conditions for finite semigroups to preserve the properties of strong subsemigroup separability and monogenic subsemigroup separability in a direct product.
Let $[n]=\{1,2,\ldots,n\}$ be a finite chain and let $\mathcal{P}_{n}$ be the semigroup of partial transformations on $[n]$. Let $\mathcal{CP}_{n}=\{α\in \mathcal{P}_{n}: (for ~all~x,y\in Dom~α)~|xα-yα|\leq|x-y|\}$ be the subsemigroup of partial contraction mappings on $[n]$. We have shown that the semigroup $\mathcal{CP}_{n}$ and some of its subsemigroups are nonregular left abundant semigroups for all $n$ but not right abundant for $n\geq 4$.
We study algebraic and topological properties of subsemigroups of the hyperspace exp(G) of non-empty compact subsets of a topological group G endowed with the Vietoris topology and the natural semigroup operation. On this base we prove that a compact Clifford topological semigroup S is topologically isomorphic to a subsemigroup of exp(G) for a suitable topological group G if and only if S is a topological inverse semigroup with zero-dimensional idempotent semilattice.
We show that a topological semigroup of finite partial bijections $\mathscr{I}_λ^n$ of an infinite set with a compact subsemigroup of idempotents is absolutely $H$-closed and any countably compact topological semigroup does not contain $\mathscr{I}_λ^n$ as a subsemigroup. We give sufficient conditions onto a topological semigroup $\mathscr{I}_λ^1$ to be non-$H$-closed. Also we describe the structure of countably compact Brandt $λ^0$-extensions of topological monoids and study the category of countably compact Brandt $λ^0$-extensions of topological monoids with zero.
We define the notion of the partial order of ends of the Cayley graph of a semigroup. We prove that the structure of the ends of a semigroup is invariant under change of finite generating set and at the same time is inherited by subsemigroups and extensions of finite Rees index. We prove an analogue of Hopf's Theorem, stating that a group has 1, 2 or infinitely many ends, for left cancellative semigroups and that the cardinality of the set of ends is invariant in subsemigroups and extension of finite Green index in left cancellative semigroups.
Taking residual finiteness as a starting point, we consider three related finiteness properties: weak subsemigroup separability, strong subsemigroup separability and complete separability. We investigate whether each of these properties is inherited by Schützenberger groups. The main result of this paper states that for a finitely generated commutative semigroup $S$, these three separability conditions coincide and are equivalent to every $\mathcal{H}$-class of $S$ being finite. We also provide examples to show that these properties in general differ for commutative semigroups and finitely gen…
Let $a$ be an element of a semigroup $S$. The local subsemigroup of $S$ with respect to $a$ is the subsemigroup $aSa$ of $S$. The variant of $S$ with respect to $a$ is the semigroup with underlying set $S$ and operation $\star_a$ defined by $x\star_ay=xay$ for $x,y\in S$. We show that the following classes contain precisely the same semigroups, up to isomorphism: all local subsemigroups of all finite full transformation semigroups; and all variants of all finite full transformation semigroups. This result was discovered as a result of some experiments (and accidents) when working with the Semi…
In this paper we describe a portion of the subsemigroup lattice of the \emph{full transformation semigroup} $Ω^Ω$, which consists of all mappings on the countable infinite set $Ω$. Gavrilov showed that there are five maximal subsemigroups of $Ω^Ω$ containing the symmetric group $\sym(Ω)$. The portion of the subsemigroup lattice of $Ω^Ω$ which we describe is that between the intersection of these five maximal subsemigroups and $Ω^Ω$. We prove that there are only 38 subsemigroups in this interval, in contrast to the $2^{2^{\aleph_0}}$ subsemigroups between $\sym(Ω)$ and $Ω^Ω$.
We introduce a preorder on an inverse semigroup $S$ associated to any normal inverse subsemigroup $N$, that lies between the natural partial order and Green's ${\mathscr J}$-relation. The corresponding equivalence relation $\simeq_N$ is not necessarily a congruence on $S$, but the quotient set does inherit a natural ordered groupoid structure. We show that this construction permits the factorisation of any inverse semigroup homomorphism into a composition of a quotient map and a star-injective functor, and that this decomposition implies a classification of congruences on $S$. We give an appli…
For a given inverse semigroup action on a topological space, one can associate an étale groupoid. We prove that there exists a correspondence between the certain subsemigroups and the open wide subgroupoids in case that the action is strongly tight. Combining with the recent result of Brown et. al, we obtain a correspondence between the certain subsemigroups of an inverse semigroup and the Cartan intermediate subalgebras of a groupoid C*-algebra.
In this paper, the notion of bipolar-valued fuzzy LA-subsemigroups is introduced and also some properties of bipolar-valued fuzzy left (right, bi-, interior) ideals of LA-semigroups has been discussed.
Let $S$ be a semigroup and $T$ be a subsemigroup of finite index in $S$ (that is, the set $S\setminus T$ is finite). The subsemigroup $T$ is also called a large subsemigroup of $S$. It is well known that if $T$ has a finite complete rewriting system then so does $S$. In this paper, we will prove the converse, that is, if $S$ has a finite complete rewriting system then so does $T$. Our proof is purely combinatorial and also constructive.
In this paper we consider a number of finiteness conditions for semigroups related to their ideal structure, and ask whether such conditions are preserved by sub- or supersemigroups with finite Rees or Green index. Specific properties under consideration include stability, D=J and minimal conditions on ideals.
We give a description of finite semigroups $S$ that are minimal for not being Malcev nilpotent, i.e. every proper subsemigroup and every proper Rees factor semigroup is Malcev nilpotent but $S$ is not. For groups this question was considered by Schmidt.
In this paper we study the regular semigroups weakly generated by a single element x, that is, with no proper regular subsemigroup containing x. We show there exists a regular semigroup $F_1$ weakly generated by x such that all other regular semigroups weakly generated by x are homomorphic images of $F_1$. We define $F_1$ using a presentation where both sets of generators and relations are infinite. Nevertheless, the word problem for this presentation is decidable. We describe a canonical form for the congruence classes given by this presentation, and explain how to obtain it. We end the paper…
We consider the lattice of subsemigroups of the general linear group over an Artinian ring containing the group of diagonal matrices and show that every such semigroup is actually a group.
We describe and count the maximal subsemigroups of many well-known monoids of transformations and monoids of partitions. More precisely, we find the maximal subsemigroups of the full spectrum of monoids of order- or orientation-preserving transformations and partial permutations considered by V. H. Fernandes and co-authors (12 monoids in total); the partition, Brauer, Jones, and Motzkin monoids; and certain further monoids. Although descriptions of the maximal subsemigroups of some of the aforementioned classes of monoids appear in the literature, we present a unified framework for determining…
We study the algebraic properties of the series $\mathrm{K}_n$ of semigroups, which is inspired by \cite{Ki} and has origins in convexity theory. In particular, we describe Green's relations on $\mathrm{K}_n$, prove that there exists a faithful representation of $\mathrm{K}_n$ by $n\times n$ matrices with non-negative integer coefficients (and even explicitly construct such a representation), and prove that $\mathrm{K}_n$ does not admit a faithful representation by matrices of smaller size. We also describe the maximal nilpotent subsemigroups in $\mathrm{K}_n$, all isolated and completely isol…
We prove new results on inheritance of Green's relations by subsemigroups in the presence of stability of elements. We provide counterexamples in other cases to show in particular that not all right-stable semigroups are embeddable in left-stable semigroups. This is carried out in the context of a survey of the various closely related notions of stability and minimality of Green's classes that have appeared in the literature over the last sixty years, and which have sometimes been presented in different forms.
We define a subsemigroup $S_n$ of the rook monoid $R_n$ and investigate its properties. To do this, we represent the nonzero elements of $S_n$ (which are $n\times n$ matrices) via certain triplets of integers, and develop a closed-form expression representing the product of two elements; these tools facilitate straightforward deductions of a great number of properties. For example, we show that $S_n$ consists solely of idempotents and nilpotents, find the numbers of idempotents and nilpotents, and compute nilpotency indexes. Furthermore, we give a necessary and sufficient condition for the $j$…
Let S be a semigroup and let T be a subsemigroup of S. Then T acts on S by left- and by right multiplication. This gives rise to a partition of the complement of T in S, and to each equivalence class of this partition we naturally associate a relative Schutzenberger group. We show how generating sets for S may be used to obtain generating sets for T and the Schutzenberger groups, and vice versa. We also give a method for constructing a presentation for S from given presentations of T and the Schutzenberger groups. These results are then used to show that several important properties are preser…
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. …
Nilpotent semigroups in the sense of Mal'cev are defined by semigroup identities. Finite nilpotent semigroups constitute a pseudovariety, $\mathsf{MN}$, which has finite rank. The semigroup identities that define nilpotent semigroups, lead us to define strongly Mal'cev nilpotent semigroups. Finite strongly Mal'cev nilpotent semigroups constitute a non-finite rank pseudovariety, $\mathsf{SMN}$. The pseudovariety $\mathsf{SMN}$ is strictly contained in the pseudovariety $\mathsf{MN}$ but all finite nilpotent groups are in $\mathsf{SMN}$. We show that the pseudovariety $\mathsf{MN}$ is the inters…
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 semigroups up to degree 4. Classification of these semigroups up to conjugacy, isomorphism and anti-isomorphism, by size and rank, provides a solid base for further investigations of transformation semigroups.
We associate a graph ${\mathcal N}_{S}$ with a semigroup $S$ (called the upper non-nilpotent graph of $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). In case $S$ is a group this graph has been introduced by A. Abdollahi and M. Zarrin and some remarkable properties have been proved. The aim of this paper is to study this graph (and some related graphs, such as the non-commuting graph) and to discover the algebraic structure of $S$ determined by the associated graph. It is shown th…