• Kyungpook Mathematical Journal
• /
• 제64권1호
• /
• pp.161-169
• /
• 2024

A semi-well ordered set is a partially ordered set in which every non-empty subset of it contains a least element or a greatest element. It is defined as an extension of the concept of well ordered sets. An attempt is made to identify the properties of a semi-well ordered set equipped with the order topology.

• 대한수학회논문집
• /
• 제37권3호
• /
• pp.669-679
• /
• 2022

We provide a characterization of the positive monoids (i.e., additive submonoids of the nonnegative real numbers) that satisfy the finite factorization property. As a result, we establish that positive monoids with well-ordered generating sets satisfy the finite factorization property, while positive monoids with co-well-ordered generating sets satisfy this property if and only if they satisfy the bounded factorization property.

• Journal of applied mathematics & informatics
• /
• 제33권5_6호
• /
• pp.579-591
• /
• 2015

Properties of prime filters are studied in BE-algebras as well as in commutative BE-algebras. An equivalent condition is derived for a BE-algebra to become a totally ordered set. A condition L is introduced in a commutative BE-algebra in ordered to study some more properties of prime filters in commutative BE-algebras. A set of equivalent conditions is derived for a commutative BE-algebra to become a chain. Some topological properties of the space of all prime filters of BE-algebras are studied.

• 한국수학교육학회지시리즈B:순수및응용수학
• /
• 제7권1호
• /
• pp.33-40
• /
• 2000

We prove some characterization of rings with chain conditions in terms of fuzzy quotient rings and fuzzy ideals. We also show that a ring R is left Artinian if and only of the set of values of every fuzzy ideal on R is upper well-ordered.

• 대한수학회지
• /
• 제58권4호
• /
• pp.921-948
• /
• 2021

We continue the investigations in [6] extending the Bruhat order on n × n alternating sign matrices to our more general setting. We show that the resulting partially ordered set is a graded lattice with a well-define rank function. Many illustrative examples are given.

• Korean Journal of Mathematics
• /
• 제24권2호
• /
• pp.199-213
• /
• 2016

The resolvent operator approach of [2] is applied to solve a set-valued variational inclusion problem in ordered Hilbert spaces. The resolvent operator under consideration is called relaxed resolvent operator and we demonstrate some of its properties. To obtain the solution of a set-valued variational inclusion problem, an iterative algorithm is developed and weak-RRD set-valued mapping is used. The problem as well as main result of this paper are more general than many previous problems and results available in the literature.

• Journal of applied mathematics & informatics
• /
• 제10권1_2호
• /
• pp.251-259
• /
• 2002

The fuzzification of an ideal in a Lie algebra is considered. Using a level subset of a fuzzy subset of a Lie algebra, we give a characterization of a fuzzy ideal, and using a family of ideals of a Lie algebra, we establish a fuzzy ideal. With relation to the ascending chain of ideals, a characterization for the set of values of any fuzzy ideal to be a well-ordered subset of the closed unit interval [0,1] is stated.

• Journal of the Korean Data and Information Science Society
• /
• 제22권5호
• /
• pp.967-976
• /
• 2011

The Box-Cox transformation is a well known family of power transformations that brings a set of data into agreement with the normality assumption of the residuals and hence the response variable of a postulated model in regression analysis. Normalization (studentization) of the regressors is a common practice in analyzing microarray data. Here, we implement Box-Cox transformation in normalizing regressors in microarray data. Pridictabilty of the model can be improved using data transformation compared to studentization.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• 제11권1호
• /
• pp.59-64
• /
• 2011

In 2001, the notion of a fuzzy poset defined on a set X via a triplet (L, G, I) of functions with domain X ${\times}$ X and range [0, 1] satisfying a special condition L+G+I = 1 is introduced by J. Negger and Hee Sik Kim, where L is the 'less than' function, G is the 'greater than' function, and I is the 'incomparable to' function. Using this approach, we are able to define a special class of fuzzy posets, and define the 'skeleton' of a fuzzy poset in view of major relation. In this sense, we define the linear discrepancy of a fuzzy poset of size n as the minimum value of all maximum of I(x, y)${\mid}$f(x)-f(y)${\mid}$ for f ${\in}$ F and x, y ${\in}$ X with I(x, y) > $\frac{1}{2}$, where F is the set of all injective order-preserving maps from the fuzzy poset to the set of positive integers. We first show that the definition is well-defined. Then, it is shown that the optimality appears at the same injective order-preserving maps in both cases of a fuzzy poset and its skeleton if the linear discrepancy of a skeleton of a fuzzy poset is 1.

• 정보기술과데이타베이스저널
• /
• 제3권1호
• /
• pp.97-108
• /
• 1996

In this paper we obtain several function defined on finite partially ordered sets(posets) which may indicate constraints of comparability on sets of teams(tasks, etc.) for which evaluation is computationally simple, a relatively rare condition in graph-based algorithms. Using these functions a set of numerical coefficients and associated distributions obtained from a computer simulation of certain families of random graphs is determined. From this information estimates may be made as to the actual linearity of complicated posets. Applications of these ideas is to all areas where obtaining rankings from partial information in rational ways is relevant as in, e.g., team_, scaling_, and scheduling theory as well as in theoretical computer science. Theoretical consideration of special and desirable properties of various functions is provided permitting judgment concerning sensitivity of these functions to changes in parameters describing (finite) posets.