Meiqing Qin

Meiqing Qin

Auto-generated profile, based on publicly available information

Meiqing Qin


Research Focus & Metrics

Academic Career Length

2Years (2025-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 January 2025 in Journal of Mathematics
Verified
Journal Article
Open access
MQMeiqing Qin
Meiqing Qin
XFXuerong Fu
Xuerong Fu
Let X be a finite total order set and E be a convex equivalence relation on X . We denote that O E ( X ) = { f ∈ T E ( X ) : ∀ x , y ∈ X , x ≤ y ⟹ f ( x ) ≤ f ( y )} , where T E ( X ) is an E − preserving transformation semigroup. Obviously, O E ( X ) is a subsemigroup of T E ( X ), which is called an order‐preserving and equivalence‐preserving transformation semigroup. We fix an element θ in O E ( X ) and define a new operation ∘ on O E ( X ) by f ∘ g = f θ g . Under the operation ∘, O E ( X ) forms a semigroup, which is called a generalized semigroup of O E ( X ) and is denoted by O E ( X ; θ ). In this paper, we characterize the natural partial order on O E ( X ; θ ), and the condition under which the two elements of O E ( X ; θ ) are related to such natural partial order is also described. Furthermore, we investigate the elements of O E ( 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.

1 January 2026 in Journal of Mathematics
Verified
Journal Article
Open access
MQMeiqing Qin
Meiqing Qin
CWChaoxin Wang
Chaoxin Wang
CYChuanwen Yu
Chuanwen Yu
Let X be a nonempty set and T X be the full transformation semigroup on X . For ∅≠ Y ⊆ X , the semigroup of all transformations that leave Y invariant in T X is denoted as S ( X , Y ) = { f ∈ T X : 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.