| 分类集及极大分类集的计数 |
| |
| 引用本文： | 栾汝书.分类集及极大分类集的计数[J].清华大学学报(自然科学版),1989(3). |
| |
| 作者姓名： | 栾汝书 |
| |
| 作者单位： | 应用数学系 |
| |
| 摘 要： | Ｍ是（１，２，…，ｎ）的一些子集合的集合。若Ｍ中任意两个子集，或者它们无共同元素，或者一个是另一个的子集，这样的Ｍ称为分类集。若不存在（１，２，…，ｎ）的一个分类集包含Ｍ，称Ｍ为极大分类集。给出分类集及极大分类集个数ｔｎ及Ｔｎ的计算，并由Ｔｎ的两个递推关系式得到一些组合恒等式。
|
| 关 键 词： | 分类集 极大分类集 |
The Enumeration of Taxonomic and Maximal Taxonomic Classes of Sets |
| |
| Luan Rushu.The Enumeration of Taxonomic and Maximal Taxonomic Classes of Sets[J].Journal of Tsinghua University(Science and Technology),1989(3). |
| |
| Authors: | Luan Rushu |
| |
| Institution: | Department of Applied Mathematics |
| |
| Abstract: | Let M be a set whose elements are subsets of In= {1,2, ..., n} .M is called taxonomic class of sets if. for every two elements of M, either they are disjoint, or one is a subset of the other. M is maximal if no other taxonomic class of sets contains it. The numbers t., T. of taxonomic and maximal taxonomic classes of sets are given. From the two given recurrence relations of Tn, several combinatorial identities are obtained. |
| |
| Keywords: | taxonomic class of sets maximal taxonomic class of sets |
| 本文献已被 CNKI 等数据库收录！ |
