• Communications of the Korean Mathematical Society
• /
• v.37 no.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.

• Bulletin of the Korean Mathematical Society
• /
• v.53 no.4
• /
• pp.971-983
• /
• 2016

A partially ordered set P is ideal-homogeneous provided that for any ideals I and J, if $$I{\sim_=}_{\sigma}J$$, then there exists an automorphism ${\sigma}^*$ such that ${\sigma}^*{\mid}_I={\sigma}$. Behrendt [1] characterizes the ideal-homogeneous partially ordered sets of height 1. In this paper, we characterize the ideal-homogeneous partially ordered sets of height 2 and nd some families of ideal-homogeneous partially ordered sets.

• Bulletin of the Korean Mathematical Society
• /
• v.29 no.1
• /
• pp.117-123
• /
• 1992

The dimension problem has been one of central themes in the theory of ordered sets. In this paper we focus on amalgamated ordered sets. Although some results can be obviously applied to infinite cases, we assume throughout that all ordered set are finite. If A and B are ordered sets whose orders agree on A.cap.B, then the amalgam of A and B is defined to the the set A.cup.B in which the order is the transitive closure of the union of the two orders, i.e., the smallest order containing the two orders, and is denoted by A .or. B .leq. dim A + dim B for any ordered sets A and B. But it is quite surprising that the dimension of the amalgam of certain 2-dimensional ordered sets can be arbitrarily large.

• Bulletin of the Korean Mathematical Society
• /
• v.28 no.2
• /
• pp.243-254
• /
• 1991

For a given function f.mem.F and a set of functions J.subeq.F, the problem of isotonic optimization is to determine an element in the set nearest to f in some sense. Specifically, let X be a partially ordered finite set with a partial order << and, let F"=F(X) be the linear space of all bounded real valued functions on X. A function g.mem.F is said to be an isotonic function if g(x).leq.g(y) whenever x,y.mem.X and x << y.<< y.

• Kyungpook Mathematical Journal
• /
• v.2 no.1
• /
• pp.17-22
• /
• 1959

• Journal of the Korean Data and Information Science Society
• /
• v.15 no.2
• /
• pp.339-345
• /
• 2004

This paper deals with a mixed logit model for ordered polytomous data. There are two types of factors affecting the response varable in this paper. One is a fixed factor with finite quantitative levels and the other is a random factor coming from an experimental structure such as a randomized complete block design. It is discussed how to set up the model for analyzing ordered polytomous data and illustrated how to estimate the paramers in the given model.

• Kyungpook Mathematical Journal
• /
• v.56 no.3
• /
• pp.657-668
• /
• 2016

Given a partition ${\lambda}=({\lambda}_1,{\lambda}_2,{\ldots},{\lambda}_l)$ of a positive integer n, let Tab(${\lambda}$, k) be the set of all tabloids of shape ${\lambda}$ whose weights range over the set of all k-compositions of n and ${\mathcal{OP}}^k_{\lambda}_{rev}$ the set of all ordered partitions into k blocks of the multiset $\{1^{{\lambda}_l}2^{{\lambda}_{l-1}}{\cdots}l^{{\lambda}_1}\}$. In [2], Butler introduced an inversion-like statistic on Tab(${\lambda}$, k) to show that the rank-selected $M{\ddot{o}}bius$ invariant arising from the subgroup lattice of a finite abelian p-group of type ${\lambda}$ has nonnegative coefficients as a polynomial in p. In this paper, we introduce an inversion-like statistic on the set of ordered partitions of a multiset and construct an inversion-preserving bijection between Tab(${\lambda}$, k) and ${\mathcal{OP}}^k_{\hat{\lambda}}$. When k = 2, we also introduce a major-like statistic on Tab(${\lambda}$, 2) and study its connection to the inversion statistic due to Butler.

• Management Science and Financial Engineering
• /
• v.21 no.1
• /
• pp.1-9
• /
• 2015

We consider an m-machine flow shop scheduling problem to minimize the latest completion time, where processing times are uncertain. Processing time uncertainty is described through a finite set of processing time vectors. The objective is to minimize maximum deviation from optimality for all scenarios. Since this problem is known to be NP-hard, we consider it with an ordered property. We discuss optimality properties and develop a pseudo-polynomial time approach for the problem with a fixed number of machines and scenarios. Furthermore, we find two special structures for processing time uncertainty that keep the problem NP-hard, even for two machines and two scenarios. Finally, we investigate a special structure for uncertain processing times that makes the problem polynomially solvable.

• Communications of the Korean Mathematical Society
• /
• v.20 no.1
• /
• pp.15-21
• /
• 2005

Null designs on the poset of dual polar spaces are considered. A poset of dual polar spaces is the set of isotropic subspaces of a finite vector space equipped with a nondegenerate bilinear form, ordered by inclusion. We show that the minimum number of isotropic subspaces to construct a nonzero null t-design is ${\prod}^{t}_{i=0}(1+q^{i})$ for the types $B_N,\;D_N$, whereas for the case of type $C_N$, more isotropic subspaces are needed.

• The Journal of Information Technology and Database
• /
• v.3 no.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.