Skip to main content
SpringerLink
Log in

Properties of Graded Posets Preserved by Some Operations

  • Chapter
The Mathematics of Paul Erdös II

Part of the book series: Algorithms and Combinatorics ((AC,volume 14))

  • 1023 Accesses

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 P ∘ Q 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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 74.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Reference

  1. V.B. Alekseev. The number of monotone k-valued functions. Problemy Kibernet., 28:5–24, 1974.

    Google Scholar 

  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.

    MathSciNet  Google Scholar 

  3. E.R. Canfield. A Sperner property preserved by product. Linear and Multilinear Algebra, 9:151–157, 1980.

    Article  MathSciNet  MATH  Google Scholar 

  4. K. Engel. Optimal representations of partially ordered sets and a limit Sperner theorem. European J. Combin., 7:287–302, 1986.

    MathSciNet  MATH  Google Scholar 

  5. K. Engel and H.-D.O.F. Gronau. Sperner theory in partially ordered sets. BSB B.G. Teubner Verlagsgesellschaft, Leipzig, 1985.

    MATH  Google Scholar 

  6. P. Erdös. On a lemma of Littlewood and Offord. Bull. Amer. Math. Sos., 51:898–902, 1945.

    Article  MATH  Google Scholar 

  7. J.R. Griggs. Matchings, cutsets, and chain partitions in ranked posets. preprint, 1991.

    Google Scholar 

  8. L.H. Harper. The morphology of partially ordered sets. J. Combin. Theory, Ser. A, 17:44–58, 1974.

    Article  MathSciNet  MATH  Google Scholar 

  9. W.N. Hsieh and D.J. Kleitman. Normalized matching in direct products of partial orders. Studies in Appl. Math., 52:285–289, 1973.

    MathSciNet  MATH  Google Scholar 

  10. G.O.H. Katona. A generalization of some generalizations of Sperner’s theorem. J. Combin. Theory, Ser. B, 12:72–81, 1972

    Article  MathSciNet  MATH  Google Scholar 

  11. A. Sali. Constructions of ranked posets. Discrete Math., 70:77–83, 1988.

    Article  MathSciNet  MATH  Google Scholar 

  12. R. P. Stanley. Enumerative combinatorics, volume 1. Wadsworth & Brooks, Monterey, California, 1986.

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Math. & CS, University of Paderborn, D-33198, Paderborn, Germany

    Sergej Bezrukov

  2. Department of Math., University of Rostock, D-18051, Rostock, Germany

    Konrad Engel

Authors
  1. Sergej Bezrukov
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Konrad Engel
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. AT&T Bell Laboratories, 600 Mountain Avenue, 07974, Murray Hill, NJ, USA

    Ronald L. Graham

  2. Department of Applied Mathematics, Charles University, Malostranske nam. 25, 11800, Praha, Czech Republic

    Jaroslav Nešetřil

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Bezrukov, S., Engel, K. (1997). Properties of Graded Posets Preserved by Some Operations. In: Graham, R.L., Nešetřil, J. (eds) The Mathematics of Paul Erdös II. Algorithms and Combinatorics, vol 14. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-60406-5_8

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-60406-5_8

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-64393-4

  • Online ISBN: 978-3-642-60406-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation