Add to ORKGA 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\u27s theorem are obtained. The algorithm also leads to elementary combinatorial proofs of a number of results on lattice paths and plane partitions
Throughout our study of the enumeration of plane partitions we make use of bijective proofs to find ...
If P is a partially ordered set, a k-family of P is a subset which contains no chains of length k + ...
AbstractWe review the Green/Kleitman/Leeb interpretation of de Bruijn's symmetric chain decompositio...
AbstractA procedure for partitioning the collection of divisors of an integer into symmetric chains ...
AbstractA procedure for partitioning the collection of divisors of an integer into symmetric chains ...
The objectives of this paper are three-fold. First, we would like to call attention to a very attrac...
AbstractThe objectives of this paper are three-fold. First, we would like to call attention to a ver...
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...
AbstractA ranked poset P has the Sperner property if the sizes of the largest rank and of the larges...
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...
An equivalence on the family of subsets of an e-element set E is hereditary if |a| = |b| and |x{⊆a:x...
AbstractNew properties that involve matchings, cutsets, or skipless chain partitions in graded poset...
Throughout our study of the enumeration of plane partitions we make use of bijective proofs to find ...
Throughout our study of the enumeration of plane partitions we make use of bijective proofs to find ...
If P is a partially ordered set, a k-family of P is a subset which contains no chains of length k + ...
AbstractWe review the Green/Kleitman/Leeb interpretation of de Bruijn's symmetric chain decompositio...
AbstractA procedure for partitioning the collection of divisors of an integer into symmetric chains ...
AbstractA procedure for partitioning the collection of divisors of an integer into symmetric chains ...
The objectives of this paper are three-fold. First, we would like to call attention to a very attrac...
AbstractThe objectives of this paper are three-fold. First, we would like to call attention to a ver...
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...
AbstractA ranked poset P has the Sperner property if the sizes of the largest rank and of the larges...
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...
An equivalence on the family of subsets of an e-element set E is hereditary if |a| = |b| and |x{⊆a:x...
AbstractNew properties that involve matchings, cutsets, or skipless chain partitions in graded poset...
Throughout our study of the enumeration of plane partitions we make use of bijective proofs to find ...
Throughout our study of the enumeration of plane partitions we make use of bijective proofs to find ...
If P is a partially ordered set, a k-family of P is a subset which contains no chains of length k + ...
AbstractWe review the Green/Kleitman/Leeb interpretation of de Bruijn's symmetric chain decompositio...