Skew Pairs of Idempotents in Partial Transformation Semigroups

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.

NUMERICAL AND GRAPHICAL RESULTS OF FINITE SYMMETRIC INVERSE (I_{n}) AND FULL (T_{n}) TRANSFORMATION SEMIGROUPS

Supposed is a finite set, then a function is called a finite partial transformation semigroup , which moves elements of from its domain to its co-domain by a distance of where . The total work done by the function is therefore the sum of these distances. It is a known fact that and . In this this research paper, we have mainly presented the numerical solutions of the total work done, the average work done by functions on the finite symmetric inverse semigroup of degree , and the finite full transformation semigroup of degree , as well as their respective powers for a given fixed time in space. We used an effective methodology and valid combinatorial results to generalize the total work done, the average work done and powers of each of the transformation semigroups. The generalized results were tested by substituting small values of and a specified fixed times in space. Graphs were plotted in each case to illustrate the nature of the total work done and the average work done. The results obtained in this research article have an important application in some branch of physics and theoretical computer science

Algebraic Properties of Intuitionistic L-fuzzy Multiset Finite Automata

Algrbraic properties and structures of intuitionistic L -fuzzy multiset finite automata (ILFMA) are discussed through congruences on a semigroup in this paper. Firstly,we put forward the notion of the intuitionistic L -fuzzy compatible relation, the compatible monoid associated to the intuitionistic L- fuzzy compatible relation can be effectively constructed, and we construct two finite monoids through two different congruence relations on a given ILFMA, then we also prove that they are isomorphic. Furthermore, using the quotient structure of ILFMA, algebraic properties of intuitionistic L -fuzzy multiset transformation semigroup are discussed. According to intuitionistic L -admissible relation and homomorphism of ILFMA, we show that there is a bijective correspondence between an ILFMA and the quotient structure of another ILFMA.

Regularity of Semigroups of Transformations Whose Characters Form the Semigroup of a Δ -Structure

In this paper, we make use of the notion of the character of a transformation on a fixed set X , provided by Purisang and Rakbud in 2016, and the notion of a Δ -structure on X , provided by Magill Jr. and Subbiah in 1974, to define a sub-semigroup of the full-transformation semigroup T X . We also define a sub-semigroup of that semigroup. The regularity of those two semigroups is also studied.

Characterizations of Cayley graphs of finite transformation semigroups with restricted range

The transformation semigroup with restricted range [Formula: see text] is the set of all functions from a set [Formula: see text] into a non-empty subset [Formula: see text] of [Formula: see text]. In this paper, we characterize Cayley graphs of [Formula: see text] with the connection set [Formula: see text]. Moreover, the undirected property of Cayley graphs Cay [Formula: see text] is studied.

Numerical Solutions of the Work Done on Finite Order-Preserving Injective Partial Transformation Semigroup

In this research work, we have used an effective methodology to obtain formulas for calculating the total work done and consequently the average work done and the power of the transformation by elements of finite order-preserving injective partial transformation semigroup. The generalized formulas was applied to obtain the numerical solutions and results tabulated. We equally plot graphs to illustrate the nature of the total work done and the average work done by elements of the finite order-preserving partial transformation semigroup. Results obtained showed that moving the elements from domain to co-domain involve allot of work to be done on a numerical scale

The complexity of properties of transformation semigroups

We investigate the computational complexity for determining various properties of a finite transformation semigroup given by generators. We introduce a simple framework to describe transformation semigroup properties that are decidable in [Formula: see text]. This framework is then used to show that the problems of deciding whether a transformation semigroup is a group, commutative or a semilattice are in [Formula: see text]. Deciding whether a semigroup has a left (respectively, right) zero is shown to be [Formula: see text]-complete, as are the problems of testing whether a transformation semigroup is nilpotent, [Formula: see text]-trivial or has central idempotents. We also give [Formula: see text] algorithms for testing whether a transformation semigroup is idempotent, orthodox, completely regular, Clifford or has commuting idempotents. Some of these algorithms are direct consequences of the more general result that arbitrary fixed semigroup equations can be tested in [Formula: see text]. Moreover, we show how to compute left and right identities of a transformation semigroup in polynomial time. Finally, we show that checking whether an element is regular is [Formula: see text]-complete.