| 套链分解 |
| |
| 引用本文： | 张华军.套链分解[J].数学研究及应用,2008,28(1):39-45. |
| |
| 作者姓名： | 张华军 |
| |
| 作者单位： | Department of Applied Mathematics, Dalian University of Technology, Liaoning 116024, China |
| |
| 摘 要： | Let X1,X2,...,Xk be k disjoint subsets of S with the same cardinality m.Define H(m,k) = {X (C) S: X (C) Xi for 1 ≤I ≤k} and P(m,k) = {X (C) S : X ∩ Xi ≠φ for at least two Xi's}.Suppose S = Uki=1 Xi,and let Q(m,k,2) be the collection of all subsets K of S satisfying|K ∩ Xi|≥ 2 for some 1 ≤ I ≤ k.For any two disjoint subsets Y1 and Y2 of S,we define F1,j = {X (C) S : either |X ∩ Y1|≥ 1 or |X ∩ Y2|≥ j}.It is obvious that the four posers are graded posets ordered by inclusion.In this paper we will prove that the four posets are nested chain orders.
|
| 关 键 词： | poser normalized matching property sperner property nested chain decomposition 链分解 Order Chain paper prove nested chain four ordered inclusion collection subsets cardinality |
| 收稿时间： | 2005-12-26 |
| 修稿时间： | 2006-03-02 |
Nested Chain Order |
| |
| ZHANG Hua-jun.Nested Chain Order[J].Journal of Mathematical Research with Applications,2008,28(1):39-45. |
| |
| Authors: | ZHANG Hua-jun |
| |
| Institution: | Department of Applied Mathematics, Dalian University of Technology, Liaoning 116024, China |
| |
| Abstract: | Let X1,X2,...,Xk be k disjoint subsets of S with the same cardinality m.Define H(m,k) = {X (C) S: X (C) Xi for 1 ≤I ≤k} and P(m,k) = {X (C) S : X ∩ Xi ≠φ for at least two Xi's}.Suppose S = Uki=1 Xi,and let Q(m,k,2) be the collection of all subsets K of S satisfying|K ∩ Xi|≥ 2 for some 1 ≤ I ≤ k.For any two disjoint subsets Y1 and Y2 of S,we define F1,j = {X (C) S : either |X ∩ Y1|≥ 1 or |X ∩ Y2|≥ j}.It is obvious that the four posers are graded posets ordered by inclusion.In this paper we will prove that the four posets are nested chain orders. |
| |
| Keywords: | poset normalized matching property sperner property nested chain decomposi-tion |
| 本文献已被 维普 万方数据 等数据库收录！ |
| 点击此处可从《数学研究及应用》浏览原始摘要信息 |
| 点击此处可从《数学研究及应用》下载免费的PDF全文 |
|
