An upper bound for the size of the largest antichain in the poset of partitions of an integer (Q1302155)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An upper bound for the size of the largest antichain in the poset of partitions of an integer |
scientific article; zbMATH DE number 1340634
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An upper bound for the size of the largest antichain in the poset of partitions of an integer |
scientific article; zbMATH DE number 1340634 |
Statements
An upper bound for the size of the largest antichain in the poset of partitions of an integer (English)
0 references
12 December 1999
0 references
This nice and interesting paper proves a new and sharp upper bound for the ratio of the size of the largest antichain and the size of the largest level in graded posets with at least 12 elements. Furthermore it gives an (asymptotical) upper bound for the same ratio in the partition lattice of an integer.
0 references
partition lattice
0 references
partitions of an integer
0 references
Sperner theorem
0 references
upper bound
0 references
size of the largest antichain
0 references
size of the largest level in graded posets
0 references
0.850690484046936
0 references
0.8404942750930786
0 references
0.8002214431762695
0 references
