A simple upper bound on the number of antichains in \([t]^n\) (Q2279682)
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: A simple upper bound on the number of antichains in [t]^n |
scientific article; zbMATH DE number 7143300
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A simple upper bound on the number of antichains in \([t]^n\) |
scientific article; zbMATH DE number 7143300 |
Statements
A simple upper bound on the number of antichains in \([t]^n\) (English)
0 references
13 December 2019
0 references
partially ordered set
0 references
Dedekind's problem
0 references
monotonic Boolean function
0 references
0.7705190777778625
0 references
0.7647419571876526
0 references
0.7541608810424805
0 references
0.7385430335998535
0 references
