𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Partitions of a finite three-complete poset

✍ Scribed by Shiojenn Tseng; Muh-Chyi Horng


Publisher
Elsevier Science
Year
1996
Tongue
English
Weight
549 KB
Volume
148
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

✦ Synopsis


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.


πŸ“œ SIMILAR VOLUMES


The Coset Poset and Probabilistic Zeta F
✍ Kenneth S. Brown πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 175 KB

We investigate the topological properties of the poset of proper cosets xH in a finite group G. Of particular interest is the reduced Euler characteristic, which is closely related to the value at -1 of the probabilistic zeta function of G. Our main result gives divisibility properties of this reduc

Common transversals for partitions of a
✍ T.C. Brown πŸ“‚ Article πŸ“… 1984 πŸ› Elsevier Science 🌐 English βš– 725 KB

For ~22, ta?, let A, ,..., 4 be s-cell partitions of a finite set X. Assume that if x, y E X7 x # y, then x, y belong to different cells of at least one of the part&ons 4. For each k > 1, let c(s, t, k) be the least integer such that if A 1,. . . ., 4 X satisfy the preceding conditions, and the smal

The order-interval hypergraph of a finit
✍ Isma Bouchemakh; Konrad Engel πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 561 KB

We study the hypergraph ~(P) whose vertices are the points of a finite poset and whose edges are the maximal intervals in P (i.e. sets of the form I = {v ~ P:p <~ v <<. q}, p minimal, q maximal). We mention resp. show that the problems of the determination of the independence number c~, the point co

Partitions of finite vector spaces into
✍ S. I. El-Zanati; G. F. Seelinger; P. A. Sissokho; L. E. Spence; C. Vanden Eynden πŸ“‚ Article πŸ“… 2008 πŸ› John Wiley and Sons 🌐 English βš– 143 KB

## Abstract Let __V__~n~(q) denote a vector space of dimension __n__ over the field with __q__ elements. A set ${\cal P}$ of subspaces of __V__~n~(q) is a __partition__ of __V__~n~(q) if every nonzero element of __V__~n~(q) is contained in exactly one element of ${\cal P}$. Suppose there exists a p