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

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/s11083-018-9480-5
+Normal rank
@@ Property / OpenAlex ID @@
+W2903418269
@@ Property / OpenAlex ID: W2903418269 / rank @@
+Normal rank
@@ Property / cites work @@
+Strong versions of Sperner's theorem
@@ Property / cites work: Strong versions of Sperner's theorem / rank @@
+Normal rank
@@ Property / cites work @@
+Q5585384
@@ Property / cites work: Q5585384 / rank @@
+Normal rank
@@ Property / cites work @@
+Entropy, independent sets and antichains: A new approach to Dedekind’s problem
+Normal rank
@@ Property / cites work @@
+A generalization of some generalizations of Sperner's theorem
+Normal rank
@@ Property / cites work @@
+On Dedekind's Problem: The Number of Isotone Boolean Functions. II
+Normal rank
@@ Property / cites work @@
+Q3671891
@@ Property / cites work: Q3671891 / rank @@
+Normal rank
@@ Property / cites work @@
+Maximal probabilities of convolution powers of discrete uniform distributions
+Normal rank
@@ Property / cites work @@
+Ramsey theory, integer partitions and a new proof of the Erdős-Szekeres theorem
+Normal rank
@@ Property / cites work @@
+Entropy and enumeration of Boolean functions
@@ Property / cites work: Entropy and enumeration of Boolean functions / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:2279682