Skip to main content

Online Linear Discrepancy of Partially Ordered Sets

  • Chapter
Book cover An Irregular Mind

Part of the book series: Bolyai Society Mathematical Studies ((BSMS,volume 21))

  • 1640 Accesses

Abstract

This article is dedicated to Professor Endre Szemerédi on the occasion of his 70th birthday. Among his many remarkable contributions to combinatorial mathematics and theoretical computer science is a jewel for online problems for partially ordered sets: the fact that h(h + l)/2 antichains are required for an online antichain partition of a poset of height h.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 169.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

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.

References

  1. J.-O. Choi and D. B. West, Linear discrepancy and products of chains, submitted, 2008.

    Google Scholar 

  2. P. C. Fishburn, Intransitive indifference with unequal indifference intervals, J. Math. Psych., 7 (1970), 144–149.

    Article  MATH  MathSciNet  Google Scholar 

  3. P. C. Fishburn, P. J. Tanenbaum, and A. N. Trenk, Linear discrepancy and bandwidth, Order, 18 (2001), 237–245.

    Article  MATH  MathSciNet  Google Scholar 

  4. M. T. Keller and S. J. Young, Degree bounds for linear discrepancy of interval orders and disconnected posets, Discrete Math., to appear (2010).

    Google Scholar 

  5. H. Kierstead and W. T. Trotter, An extremal problem in recursive combinatorics, Congressus Numerantium, 33 (1981), 143–153.

    MathSciNet  Google Scholar 

  6. T. Kloks, D. Kratsch and H. Müller, Approximating the bandwidth for asteroidal triple-free graphs, J. Algorithms, 32, 1 (1999), 41–57.

    Article  MATH  MathSciNet  Google Scholar 

  7. D. Rautenbach, A note on linear discrepancy and bandwidth, J. Combin. Math. Combin. Comput., 55 (2005), 199–208.

    MATH  MathSciNet  Google Scholar 

  8. D. Scott and P. Suppes, Foundational aspects of theories of measurement, J. Symb. Logic, 23 (1958), 113–128.

    Article  MathSciNet  Google Scholar 

  9. P. J. Tanenbaum, A. N. Trenk and P. C. Fishburn, Linear discrepancy and weak discrepancy of partially ordered sets, Order, 18, 3 (2001), 201–225.

    Article  MATH  MathSciNet  Google Scholar 

  10. W. T. Trotter, Combinatorics and partially ordered sets: Dimension theory, Johns Hopkins Series in the Mathematical Sciences. Johns Hopkins University Press, Baltimore, MD, 1992.

    Google Scholar 

  11. W. T. Trotter, Partially ordered sets, in: Handbook of combinatorics, Vol. 1, 2. Elsevier, Amsterdam, 1995, pp. 433–480.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2010 János Bolyai Mathematical Society and Springer-Verlag

About this chapter

Cite this chapter

Keller, M.T., Streib, N., Trotter, W.T. (2010). Online Linear Discrepancy of Partially Ordered Sets. In: Bárány, I., Solymosi, J., Sági, G. (eds) An Irregular Mind. Bolyai Society Mathematical Studies, vol 21. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-14444-8_9

Download citation

Publish with us

Policies and ethics