Let S be a regular semigroup. A pair (e,f) of idempotents of S is said to be a skew pair of idempotents if fe is idempotent, but ef is not. T. S. Blyth and M. H. Almeida (T. S. Blyth and M. H. Almeida, skew pair of idempotents in transformation semigroups, Acta Math. Sin. (English Series), 22 (2006), 1705–1714) gave a characterization of four types of skew pairs—those that are strong, left regular, right regular, and discrete—existing in a full transformation semigroup T(X). In this paper, we do in this line for partial transformation semigroups
Semigroup is a structure with a associative binary operation. Since semigroup may not have an identi...
Abstract Denote by T (X) the semigroup of full transformations on a set X. For ε ∈ T (X), the centra...
In1987 Sullivan determined the elements of the semigroup N (X ) generated by all nilpotent partial t...
An ordered pair (e, f) of idempotents of a regular semigroup is called a skew pair if ef is not idem...
An ordered pair (e, f) of idempotents of a regular semigroup is called a skew pair if ef is not idem...
An ordered pair (e, f) of idempotents of a regular semigroup is called a skew pair if ef is not idem...
Let S be a regular semigroup with set of idempotents E(S). Given x, y is an element of S, we say tha...
Let S be a regular semigroup with set of idempotents E(S). Given x, y is an element of S, we say tha...
A semigroup $S$ is called \emph{idempotent-surjective} [\emph{regular-surjective}] if whenever $\rho...
We give a presentation for the semigroup of all singular partial transformations on a finite set, in...
A semigroup $S$ is called \emph{idempotent-surjective} [\emph{regular-surjective}] if whenever $\rho...
A semigroup $S$ is called \emph{idempotent-surjective} [\emph{regular-surjective}] if whenever $\rho...
A semigroup $S$ is called \emph{idempotent-surjective} [\emph{regular-surjective}] if whenever $\rho...
A semigroup $S$ is called \emph{idempotent-surjective} [\emph{regular-surjective}] if whenever $\rho...
Edwards describes in [4] the maximum idempotent-separating congruence on a eventually regular (equiv...
Semigroup is a structure with a associative binary operation. Since semigroup may not have an identi...
Abstract Denote by T (X) the semigroup of full transformations on a set X. For ε ∈ T (X), the centra...
In1987 Sullivan determined the elements of the semigroup N (X ) generated by all nilpotent partial t...
An ordered pair (e, f) of idempotents of a regular semigroup is called a skew pair if ef is not idem...
An ordered pair (e, f) of idempotents of a regular semigroup is called a skew pair if ef is not idem...
An ordered pair (e, f) of idempotents of a regular semigroup is called a skew pair if ef is not idem...
Let S be a regular semigroup with set of idempotents E(S). Given x, y is an element of S, we say tha...
Let S be a regular semigroup with set of idempotents E(S). Given x, y is an element of S, we say tha...
A semigroup $S$ is called \emph{idempotent-surjective} [\emph{regular-surjective}] if whenever $\rho...
We give a presentation for the semigroup of all singular partial transformations on a finite set, in...
A semigroup $S$ is called \emph{idempotent-surjective} [\emph{regular-surjective}] if whenever $\rho...
A semigroup $S$ is called \emph{idempotent-surjective} [\emph{regular-surjective}] if whenever $\rho...
A semigroup $S$ is called \emph{idempotent-surjective} [\emph{regular-surjective}] if whenever $\rho...
A semigroup $S$ is called \emph{idempotent-surjective} [\emph{regular-surjective}] if whenever $\rho...
Edwards describes in [4] the maximum idempotent-separating congruence on a eventually regular (equiv...
Semigroup is a structure with a associative binary operation. Since semigroup may not have an identi...
Abstract Denote by T (X) the semigroup of full transformations on a set X. For ε ∈ T (X), the centra...
In1987 Sullivan determined the elements of the semigroup N (X ) generated by all nilpotent partial t...