Related papers: Comparing Numbers of Diagonal Subsemigroups and Co…

A subset $A$ of a semigroup $S$ is called a $chain$ ($antichain$) if $xy\in\{x,y\}$ ($xy\notin\{x,y\}$) for any (distinct) elements $x,y\in S$. A semigroup $S$ is called ($anti$)$chain$-$finite$ if $S$ contains no infinite (anti)chains. We…

We study group congruences on the semigroup $\boldsymbol{B}_{\omega}^{\mathscr{F}}$ and its homomorphic retracts in the case when an ${\omega}$-closed family $\mathscr{F}$ which consists of inductive non-empty subsets of $\omega$. It is…

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…

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…

The \emph{difference subgroup graph} $D(G)$ of a finite group $G$ is defined as the graph whose vertices are the non-trivial proper subgroups of $G$, with two distinct vertices $H$ and $K$ adjacent if and only if $\langle H, K \rangle = G$…

Let $S$ be a semigroup, $\Lambda$ a non-empty set and $P$ a mapping of $\Lambda$ into $S$. The set $S\times \Lambda$ together with the operation $\circ _P$ defined by $(s, \lambda)\circ _P(t, \mu )=(sP(\lambda)t, \mu )$ form a semigroup…

We define the notion of a semicharacter of a group G : A function from the group to C*, whose restriction to any abelian subgroup is a homomorphism. We conjecture that for any finite group, the order of the group of semicharacters is…

Given a semigroup $S$ and $s,t \in S$, write $s \sim_p^1 t$ if $s=pr$ and $t=rp$, for some $p,r \in S \cup \{1\}$. This relation, known as "primary conjugacy", along with its transitive closure $\sim_p$, has been extensively used and…

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…

Given any digraph $D$ without loops or multiple arcs, there is a natural construction of a semigroup $\langle D\rangle$ of transformations. To every arc $(a,b)$ of $D$ is associated the idempotent transformation $(a\to b)$ mapping $a$ to…

If $S=<d_1,...,d_\nu>$ is a numerical semigroup, we call the ring $\C[S]=\C[t^{d_1},...,t^{d_\nu}]$ the semigroup ring of $S$. We study the ring of differential operators on $\C[S]$, and its associated graded in the filtration induced by…

A semigroup $S$ is called an equational domain (e.d.) if any finite union of algebraic sets over $S$ is algebraic. For a semigroup $S$ with a finite ideal we find the necessary and sufficient conditions to be an e.d.

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.

For each subchain $X'$ of a chain $X$, let $T_{RE}(X, X')$ denote the semigroup under composition of all full regressive transformations, $\alpha:X\rightarrow X'$ satisfying $x\alpha\leq x$ for all $x\in X$. Necessary and sufficient…

Let ${\cal M}(S; \Lambda; P)$ denote a Rees $I\times \Lambda$ matrix semigroup without zero over a semigroup $S$, where $I$ is a singleton. If $\theta _S$ denotes the kernel of the right regular representation of a semigroup $S$, then a…

In this paper we focus on Rees $I\times \Lambda$ matrix semigroups without zero over a semigroup $S$ with $\Lambda\times I$ sandwich matrix $P$, where $I$ is a singleton, $\Lambda$ is the factor semigroup of $S$ modulo the kernel $\theta_S$…

A DR-semigroup $S$ (also known as a reduced E-semiabundant or reduced E-Fountain semigroup) is here viewed as a semigroup equipped with two unary operations $D,R$ satisfying finitely many equational laws. Examples include DRC-semigroups…

A semigroup $S$ is an equational domain if any finite union of algebraic sets over $S$ is algebraic. We prove that if an inverse semigroup $S$ is an equational domain in the extended language $\{\cdot,{}^{-1}\}\cup\{s|s\in S\}$ then $S$ is…

Two subanalytic subsets of R^n are called s-equivalent at a common point P if the Hausdorff distance between their intersections with the sphere centered at P of radius r vanishes of order greater than s when r tends to 0. In this paper we…

Let $\mathcal C \subset \mathbb N^p$ be a finitely generated integer cone and $S\subset \mathcal C$ be an affine semigroup such that the real cones generated by $\mathcal C$ and by $S$ are equal. The semigroup $S$ is called $\mathcal…