A simple upper bound on the number of antichains in \([t]^n\) (Q2279682): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Strong versions of Sperner's theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5585384 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Entropy, independent sets and antichains: A new approach to Dedekind’s problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A generalization of some generalizations of Sperner's theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Dedekind's Problem: The Number of Isotone Boolean Functions. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3671891 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximal probabilities of convolution powers of discrete uniform distributions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ramsey theory, integer partitions and a new proof of the Erdős-Szekeres theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Entropy and enumeration of Boolean functions / rank
 
Normal rank

Latest revision as of 07:01, 21 July 2024

scientific article
Language Label Description Also known as
English
A simple upper bound on the number of antichains in \([t]^n\)
scientific article

    Statements