Counting set systems by weight (Q1773202)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 2161312
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Counting set systems by weight |
scientific article; zbMATH DE number 2161312 |
Statements
Counting set systems by weight (English)
0 references
25 April 2005
0 references
It is well known that the Bell numbers count the total number of ways a set of \(n\) elements can be partitioned into nonempty, mutually disjoint subsets. This paper considers the situation when the subsets may intersect. The main result states that such a number is asymptotically larger than the Bell number by an exponential factor. The enumeration problem can also be formulated as counting 0-1 matrices satisfying certain properties.
0 references
set partitions
0 references
Bell numbers
0 references
0.7427053451538086
0 references
0.7169936299324036
0 references
0.7117529511451721
0 references
0.7114478945732117
0 references
