AbstractA procedure for partitioning the collection of divisors of an integer into symmetric chains is described and analyzed in detail. As a consequence, several strengthenings of Sperner's theorem are obtained. The algorithm also leads to elementary combinatorial proofs of a number of results on lattice paths and plane partitions
We determine the asymptotics of the largest family of qualitatively 2-independent k-partitions of an...
AbstractIn this journal, Daniel I. A. Cohen [2] gave a proof of the strong Sperner lemma based on “s...
We determine the asymptotics of the largest family of qualitatively 2-independent k-partitions of an...
A procedure for partitioning the collection of divisors of an integer into symmetric chains is descr...
AbstractA procedure for partitioning the collection of divisors of an integer into symmetric chains ...
AbstractThe objectives of this paper are three-fold. First, we would like to call attention to a ver...
The objectives of this paper are three-fold. First, we would like to call attention to a very attrac...
International audienceWe prove that the noncrossing partition lattices associated with the complex r...
International audienceWe prove that the noncrossing partition lattices associated with the complex r...
AbstractThe objectives of this paper are three-fold. First, we would like to call attention to a ver...
AbstractKatona has proven a generalization of Sperner's theorem concerning the maximum size of a col...
AbstractA ranked poset P has the Sperner property if the sizes of the largest rank and of the larges...
AbstractNew properties that involve matchings, cutsets, or skipless chain partitions in graded poset...
An equivalence on the family of subsets of an e-element set E is hereditary if |a| = |b| and |x{⊆a:x...
AbstractAn old conjecture of Stanley's is confirmed, namely that the lattice of bounded column stric...
We determine the asymptotics of the largest family of qualitatively 2-independent k-partitions of an...
AbstractIn this journal, Daniel I. A. Cohen [2] gave a proof of the strong Sperner lemma based on “s...
We determine the asymptotics of the largest family of qualitatively 2-independent k-partitions of an...
A procedure for partitioning the collection of divisors of an integer into symmetric chains is descr...
AbstractA procedure for partitioning the collection of divisors of an integer into symmetric chains ...
AbstractThe objectives of this paper are three-fold. First, we would like to call attention to a ver...
The objectives of this paper are three-fold. First, we would like to call attention to a very attrac...
International audienceWe prove that the noncrossing partition lattices associated with the complex r...
International audienceWe prove that the noncrossing partition lattices associated with the complex r...
AbstractThe objectives of this paper are three-fold. First, we would like to call attention to a ver...
AbstractKatona has proven a generalization of Sperner's theorem concerning the maximum size of a col...
AbstractA ranked poset P has the Sperner property if the sizes of the largest rank and of the larges...
AbstractNew properties that involve matchings, cutsets, or skipless chain partitions in graded poset...
An equivalence on the family of subsets of an e-element set E is hereditary if |a| = |b| and |x{⊆a:x...
AbstractAn old conjecture of Stanley's is confirmed, namely that the lattice of bounded column stric...
We determine the asymptotics of the largest family of qualitatively 2-independent k-partitions of an...
AbstractIn this journal, Daniel I. A. Cohen [2] gave a proof of the strong Sperner lemma based on “s...
We determine the asymptotics of the largest family of qualitatively 2-independent k-partitions of an...
DOI
Add to ORKG