A simple upper bound on the number of antichains in [t]^n

DOI10.1007/S11083-018-9480-5zbMATH Open1444.05012OpenAlexW2903418269MaRDI QIDQ2279682FDOQ2279682

S. F. Tsai

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

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

zbMATH Keywords

partially ordered setmonotonic Boolean functionDedekind's problem

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorial aspects of partitions of integers (05A17) Combinatorics of partially ordered sets (06A07)

Cites Work

• Title not available (Why is that?)
• On Dedekind's Problem: The Number of Isotone Boolean Functions. II
• Title not available (Why is that?)
• Ramsey theory, integer partitions and a new proof of the Erdős-Szekeres theorem
• Strong versions of Sperner's theorem
• Entropy, independent sets and antichains: A new approach to Dedekind's problem
• A generalization of some generalizations of Sperner's theorem
• Entropy and enumeration of Boolean functions
• Maximal probabilities of convolution powers of discrete uniform distributions

Cited In (4)

• Antichains, the stick principle, and a matching number
• On $k$-antichains in the unit $n$-cube
• On the number of maximal antichains in Boolean lattices for \(n\) up to 7
• The size of the maximum antichains in products of linear orders

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)