Let X be a finite total order set and E be a convex equivalence relation on X . We denote that OE ( X ) = { f ∈ TE ( X ) : ∀ x , y ∈ X , x ≤ y ⟹ f ( x ) ≤ f ( y )} , where TE ( X ) is an E − preserving transformation semigroup. Obviously, OE ( X ) is a subsemigroup of TE ( X ), which is called an order‐preserving and equivalence‐preserving transformation semigroup. We fix an element θ in OE ( X ) and define a new operation ∘ on OE ( X ) by f ∘ g = fθg . Under the operation ∘, OE ( X ) forms a semigroup, which is called a generalized semigroup of OE ( X ) and is denoted by OE ( X ; θ ). In this paper, we characterize the natural partial order on OE ( X ; θ ), and the condition under which the two elements of OE ( X ; θ ) are related to such natural partial order is also described. Furthermore, we investigate the elements of OE ( X ; θ ) that are compatible with this partial order and find out the maximal (minimal) elements. This study not only contributes to a deeper understanding of the internal structure of semigroups and the interactions between elements but can also be used to analyze the optimal path selection in graph theory and optimize traffic distribution problems in networks.
Let X be a nonempty set and TX be the full transformation semigroup on X . For ∅≠ Y ⊆ X , the semigroup of all transformations that leave Y invariant in TX is denoted as S ( X , Y ) = { f ∈ TX : f ( Y )⊆ Y }. We fix an element θ ∈ S ( X , Y ) and specify an operation ∗ on S ( X , Y ) by f ∗ g = fθg , where fθg denotes the produce of θ , g and f in the general sense. Under the operation, ∗ S ( X , Y ) formes a semigroup which is called generalized semigroup and denoted as S ( X , Y , ∗ θ ). In this paper, we first endow the semigroup S ( X , Y , ∗ θ ) with a partial order relation and characterize the conditions under which two elements are related with respect to this partial order relation. Then, we describe the elements of the semigroup that are compatible with respect to this relation as well as extremely maximal (minimal) elements. Finally, we study the application of the partial order relation on the generalized semigroup S ( X , Y , ∗ θ ) in cryptography and computer science.