给出计算偏序集<A,R>的盖住关系的关系矩阵的算法如下:Procedure求哈斯图对应关系阵(MR:n×n偏序关系阵)Q:=MR-I fori:=1ton forj:=1ton fork:=1ton qik:=qik-qik qij qjk end end end{Q=[qij]为Hasse图对应关系}.
Set of integers, Z<sub>n</sub> is split into even-odd parts. The even part is arranged in ways, while the odd part fixes one point at a time to compliment the even part thereby forming the semigroup, AZ<...Set of integers, Z<sub>n</sub> is split into even-odd parts. The even part is arranged in ways, while the odd part fixes one point at a time to compliment the even part thereby forming the semigroup, AZ<sub>n</sub>. Thus, -spaces are filled choosing maximum of two even points at a time. Green’s relations have formed important structures that enhance the algebraic study of transformation semigroups. The semigroup of Alternating Nonnegative Integers for n-even (AZ<sub>n</sub><sub>-even</sub>) is shown to have only two D-classes, and there are -classes for n≥4. The cardinality of L-classes is constant. Certain cardinalities and some other properties were derived. The coefficients of the zigzag triples obtained are 1, and . The second and third coefficients can be obtained by zigzag addition.展开更多
This paper mainly investigates the semicontinuity of solution mappings for set optimization problems under a partial order set relation instead of upper and lower set less order relations. To this end, we propose two ...This paper mainly investigates the semicontinuity of solution mappings for set optimization problems under a partial order set relation instead of upper and lower set less order relations. To this end, we propose two types of monotonicity definition for the set-valued mapping introduced by two nonlinear scalarization functions which are presented by these partial order relations. Then, we give some sufficient conditions for the semicontinuity and closedness of solution mappings for parametric set optimization problems. The results presented in this paper are new and extend the main results given by some authors in the literature.展开更多
文摘给出计算偏序集<A,R>的盖住关系的关系矩阵的算法如下:Procedure求哈斯图对应关系阵(MR:n×n偏序关系阵)Q:=MR-I fori:=1ton forj:=1ton fork:=1ton qik:=qik-qik qij qjk end end end{Q=[qij]为Hasse图对应关系}.
文摘Set of integers, Z<sub>n</sub> is split into even-odd parts. The even part is arranged in ways, while the odd part fixes one point at a time to compliment the even part thereby forming the semigroup, AZ<sub>n</sub>. Thus, -spaces are filled choosing maximum of two even points at a time. Green’s relations have formed important structures that enhance the algebraic study of transformation semigroups. The semigroup of Alternating Nonnegative Integers for n-even (AZ<sub>n</sub><sub>-even</sub>) is shown to have only two D-classes, and there are -classes for n≥4. The cardinality of L-classes is constant. Certain cardinalities and some other properties were derived. The coefficients of the zigzag triples obtained are 1, and . The second and third coefficients can be obtained by zigzag addition.
文摘This paper mainly investigates the semicontinuity of solution mappings for set optimization problems under a partial order set relation instead of upper and lower set less order relations. To this end, we propose two types of monotonicity definition for the set-valued mapping introduced by two nonlinear scalarization functions which are presented by these partial order relations. Then, we give some sufficient conditions for the semicontinuity and closedness of solution mappings for parametric set optimization problems. The results presented in this paper are new and extend the main results given by some authors in the literature.
