A simple upper bound on the number of antichains in [t]^n
From MaRDI portal
Publication:2279682
Recommendations
- An upper bound of the cardinality of antichain boundary in the n-cube
- A shorter, simpler, stronger proof of the Meshalkin--Hochberg--Hirsch bounds on componentwise antichains
- Enumeration of certain classes of antichains
- Entropy, independent sets and antichains: A new approach to Dedekind's problem
- scientific article; zbMATH DE number 4187724
Cites work
- scientific article; zbMATH DE number 3825713 (Why is no real title available?)
- scientific article; zbMATH DE number 3304025 (Why is no real title available?)
- A generalization of some generalizations of Sperner's theorem
- Entropy and enumeration of Boolean functions
- Entropy, independent sets and antichains: A new approach to Dedekind's problem
- Maximal probabilities of convolution powers of discrete uniform distributions
- On Dedekind's Problem: The Number of Isotone Boolean Functions. II
- Ramsey theory, integer partitions and a new proof of the Erdős-Szekeres theorem
- Strong versions of Sperner's theorem
Cited in
(5)
This page was built for publication: A simple upper bound on the number of antichains in \([t]^n\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2279682)