Opening book details…
Can I read Partitions of a Finite Three-complete Poset on EtoBox?
Partitions of a Finite Three-complete Poset by Shiojenn Tseng; Muh-Chyi Horng is a Computer Science article available to read on EtoBox.
What is Partitions of a Finite Three-complete Poset about?
Let P be a finite poset covered by three nonempty disjoint chains 7"1, T2, and T3. Suppose that p and q are different members of P. Also, P has the property that if p and q are in different chains and p < q, then P ---above{p} u below{q}. D.E. Daykin and J.W. Daykin (1985) made the conjecture: "There is a partition P = R~ u R2 w ... w Rn such that R1 < R2 < ... < R,. For each integer i, 1 <~ i ~< n, either Ri and Tj are disjoint for some j in { 1, 2, 3}, or if p and q are members of Ri, then we have the following property: If p and q are in different chains, then p and q are incomparable." In this paper, we give the complete structural details of this conjecture and prove it.
Who reads Partitions of a Finite Three-complete Poset?
It is typically read by researchers, students, and practitioners in Computer Science.
- Author
- Shiojenn Tseng; Muh-Chyi Horng
- Publisher
- Elsevier Science; Elsevier ; Elsevier BV (ISSN 0012-365X)
- Published
- 1996
- Language
- EN
- Field
- Computer Science (Physical Sciences)