• 제목/요약/키워드: (n, n − 1, j)-poset

검색결과 3건 처리시간 0.023초

NONBINARY INCIDENCE CODES OF (n, n − 1, j)-POSET

  • Yan, Longhe
    • Korean Journal of Mathematics
    • /
    • 제17권2호
    • /
    • pp.169-179
    • /
    • 2009
  • Let P be a (n, n − 1, j)-poset, which is a partially ordered set of cardinality n with n − 1 maximal elements and $j(1{\leq}j{\leq}n-1)$ minimal elements, and $P^*$ the dual poset of P. In this paper, we obtain two types of incidence codes of nonempty proper subset S of P and $P^*$, respectively, by using Bogart's method [1] (see Theorem 3.3).

  • PDF

The Linear Discrepancy of a Fuzzy Poset

  • Cheong, Min-Seok;Chae, Gab-Byung;Kim, Sang-Mok
    • 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.

LOWER BOUNDS OF THE NUMBER OF JUMP OPTIMAL LINEAR EXTENSIONS : PRODUCTS OF SOME POSETS

  • Jung, Hyung-Chan
    • 대한수학회보
    • /
    • 제32권2호
    • /
    • pp.171-177
    • /
    • 1995
  • Let P be a finite poset and let $\mid$P$\mid$ be the number of vertices in pp. A subposet of P is a subset of P with the induced order. A chain C in P is a subposet of P which is a linear order. The length of the chain C is $\mid$C$\mid$ - 1. A linear extension of a poset P is a linear order $L = x_1, x_2, \ldots, x_n$ of the elements of P such that $x_i < x_j$ is P implies i < j. Let L(P) be the set of all linear extensions of pp. E. Szpilrajn [5] showed that L(P) is not empty.

  • PDF