Advertisement

Properties of Graded Posets Preserved by Some Operations

  • Sergej Bezrukov
  • Konrad Engel
Part of the Algorithms and Combinatorics book series (AC, volume 14)

Summary

We answer the following question: Let P and Q be graded posets having some property and let ∘ be some posets operation. Is it true that PQ has also this property? The considered properties are: being Sperner, a symmetric chain order, Peck, LYM, and rank compressed. The studied operations are: direct product, direct sum, ordinal sum, ordinal product, rankwise direct product, and exponentiation.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Reference

  1. 1.
    V.B. Alekseev. The number of monotone k-valued functions. Problemy Kibernet., 28:5–24, 1974.Google Scholar
  2. 2.
    N.G.de Bruijn, C.A.v.E. Tengbergen, and D. Kruyswijk. On the set of divisors of a number. Nieuw Arch. Wiskunde, 23:191–193, 1951.MathSciNetGoogle Scholar
  3. 3.
    E.R. Canfield. A Sperner property preserved by product. Linear and Multilinear Algebra, 9:151–157, 1980.MathSciNetzbMATHCrossRefGoogle Scholar
  4. 4.
    K. Engel. Optimal representations of partially ordered sets and a limit Sperner theorem. European J. Combin., 7:287–302, 1986.MathSciNetzbMATHGoogle Scholar
  5. 5.
    K. Engel and H.-D.O.F. Gronau. Sperner theory in partially ordered sets. BSB B.G. Teubner Verlagsgesellschaft, Leipzig, 1985.zbMATHGoogle Scholar
  6. 6.
    P. Erdös. On a lemma of Littlewood and Offord. Bull. Amer. Math. Sos., 51:898–902, 1945.zbMATHCrossRefGoogle Scholar
  7. 7.
    J.R. Griggs. Matchings, cutsets, and chain partitions in ranked posets. preprint, 1991.Google Scholar
  8. 8.
    L.H. Harper. The morphology of partially ordered sets. J. Combin. Theory, Ser. A, 17:44–58, 1974.MathSciNetzbMATHCrossRefGoogle Scholar
  9. 9.
    W.N. Hsieh and D.J. Kleitman. Normalized matching in direct products of partial orders. Studies in Appl. Math., 52:285–289, 1973.MathSciNetzbMATHGoogle Scholar
  10. 10.
    G.O.H. Katona. A generalization of some generalizations of Sperner’s theorem. J. Combin. Theory, Ser. B, 12:72–81, 1972MathSciNetzbMATHCrossRefGoogle Scholar
  11. 11.
    A. Sali. Constructions of ranked posets. Discrete Math., 70:77–83, 1988.MathSciNetzbMATHCrossRefGoogle Scholar
  12. 12.
    R. P. Stanley. Enumerative combinatorics, volume 1. Wadsworth & Brooks, Monterey, California, 1986.zbMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1997

Authors and Affiliations

  • Sergej Bezrukov
    • 1
  • Konrad Engel
    • 2
  1. 1.Department of Math. & CSUniversity of PaderbornPaderbornGermany
  2. 2.Department of Math.University of RostockRostockGermany

Personalised recommendations