• Communications of the Korean Mathematical Society
• /
• v.36 no.1
• /
• pp.189-196
• /
• 2021

Using ld-irreducible posets, we can easily characterize posets with respect to linear discrepancy. However, it is difficult to have the list of all the irreducible posets with respect to a given linear discrepancy. In this paper, we investigate some properties of disconnected posets and connected posets with respect to linear discrepancy, respectively and then we find various relationships between ld-irreducibily and connectedness. From these results, we suggest some methods to construct ld-irreducible posets.

• Bulletin of the Korean Mathematical Society
• /
• v.55 no.3
• /
• pp.777-788
• /
• 2018

A simple poset is a poset whose linear discrepancy increases if any relation of the poset is removed. In this paper, we investigate more important properties of simple posets such as its width and height which help to construct concrete simple poset of linear discrepancy l. The simplicity of a poset is similar to the ld-irreducibility of a poset. Hence, we investigate which posets are both simple and ld-irreducible. Using these properties, we characterize n-posets of linear discrepancy n - k for k = 2, 3, and, lastly, we also characterize a poset of linear discrepancy 3 with simple posets and ld-irreducible posets.

• Honam Mathematical Journal
• /
• v.41 no.4
• /
• pp.863-870
• /
• 2019

In this paper, we obtain the enumeration results on the number of linear extensions of diamond posets. We find the recurrence relations and exponential generating functions for the number of linear extensions of diamond posets. We also get some results for the volume of graph polytope associated with bipartite graphs which are underlying graphs of diamond posets.

• Journal of the Chungcheong Mathematical Society
• /
• v.25 no.3
• /
• pp.415-424
• /
• 2012

As a generalization of countably approximating posets, we introduce the concept of generalized countably approximating posets. Some properties of generalized countably approximating posets are presented.

• Bulletin of the Korean Mathematical Society
• /
• v.49 no.2
• /
• pp.373-379
• /
• 2012

In this paper, we nd the inclusion relation among four categories of posets, i.e., ideal-homogeneous, tower-homogeneous, quasi-complement-preserved, and complement-preserved posets.

• Kyungpook Mathematical Journal
• /
• v.57 no.3
• /
• pp.385-391
• /
• 2017

In this paper, we study the notion of $z^J$ - ideals of posets and explore the various properties of $z^J$-ideals in posets. The relations between topological space on Sspec(P), the set $I_Q=\{x{\in}P:L(x,y){\subseteq}I\text{ for some }y{\in}P{\backslash}Q\}$ for an ideal I and a strongly prime ideal Q of P and $z^J$-ideals are discussed in poset P.

• 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.

• Journal of the Korean Mathematical Society
• /
• v.33 no.3
• /
• pp.679-684
• /
• 1996

In this paper we try to investigate the connection between matroids and jump numbers. A couole of papers [3, 5] are known, but they discuss optimization problems with matroid structure. Here we calculate the jump numbers of some bipartite posets which are induced by matroids.

• Communications of the Korean Mathematical Society
• /
• v.18 no.4
• /
• pp.635-641
• /
• 2003

The notion of negative difference on a poset is introduced, and the interrelations between FI-algebras and posets with negative difference are discussed.

• Bulletin of the Korean Mathematical Society
• /
• v.54 no.3
• /
• pp.1081-1094
• /
• 2017

For a poset $P=(X,{\leq}_P)$, the linear discrepancy of P is the minimum value of maximal differences of all incomparable elements for all possible labelings. In this paper, we find a lower bound and an upper bound of the linear discrepancy of a product of two posets. In order to give a lower bound, we use the known result, $ld({\mathbf{m}}{\times}{\mathbf{n}})={\lceil}{\frac{mn}{2}}{\rceil}-2$. Next, we use Dilworth's chain decomposition to obtain an upper bound of the linear discrepancy of a product of a poset and a chain. Finally, we give an example touching this upper bound.