A simple upper bound on the number of antichains in \([t]^n\)
From MaRDI portal
Publication:2279682
DOI10.1007/s11083-018-9480-5zbMath1444.05012OpenAlexW2903418269MaRDI QIDQ2279682
Publication date: 13 December 2019
Published in: Order (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11083-018-9480-5
Exact enumeration problems, generating functions (05A15) Combinatorial aspects of partitions of integers (05A17) Combinatorics of partially ordered sets (06A07)
Related Items
Cites Work
- Maximal probabilities of convolution powers of discrete uniform distributions
- Strong versions of Sperner's theorem
- Ramsey theory, integer partitions and a new proof of the Erdős-Szekeres theorem
- A generalization of some generalizations of Sperner's theorem
- Entropy, independent sets and antichains: A new approach to Dedekind’s problem
- On Dedekind's Problem: The Number of Isotone Boolean Functions. II
- Entropy and enumeration of Boolean functions
- Unnamed Item
- Unnamed Item