Skip to main content
SpringerLink
Log in

Partial Orders, Lattices, Well-Founded Orderings, Unique Prime Factorization in ℤ and GCDs, Equivalence Relations, Fibonacci and Lucas Numbers, Public Key Cryptography and RSA, Distributive Lattices, Boolean Algebras, Heyting Algebras

  • Chapter
  • First Online:
Discrete Mathematics

Part of the book series: Universitext ((UTX))

  • 8026 Accesses

Abstract

There are two main kinds of relations that play a very important role in mathematics and computer science:

  1. 1.

    Partial orders

  2. 2.

    Equivalence relations

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 59.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 79.99
Price excludes VAT (USA)
  • Compact, lightweight 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. Garrett Birkhoff. Lattice Theory. Colloquium Publications, Vol. XXV. Providence, RI: AMS, third edition, 1973.

    Google Scholar 

  2. Richard Crandall and Carl Pomerance. Prime Numbers. A Computational Perspective. New York: Springer, second edition, 2005.

    MATH  Google Scholar 

  3. H. Davenport. The Higher Arithmetic. An Introduction to the Theory of Numbers. Cambridge, UK: Cambridge University Press, eighth edition, 2008.

    MATH  Google Scholar 

  4. Martin Dietzfelbinger. Primality Testing in Polynomial Time: From Randomized Algorithms to “Primes Is in P”. LNCS No. 3000. New York: Springer Verlag, first edition, 2004.

    MATH  Google Scholar 

  5. Peter Gustav Lejeune Dirichlet. Lectures on Number Theory, volume 16 of History of Mathematics. Providence, RI: AMS, first edition, 1999.

    Google Scholar 

  6. Herbert B. Enderton. Elements of Set Theory. New York: Academic Press, first edition, 1977.

    Google Scholar 

  7. Ronald L. Graham, Donald E. Knuth, and Oren Patashnik. Concrete Mathematics: A Foundation For Computer Science. Reading, MA: Addison Wesley, second edition, 1994.

    Google Scholar 

  8. Donald E. Knuth. The Art of Computer Programming, Volume 2: Seminumerical Algorithms. Reading, MA: Addison Wesley, third edition, 1997.

    Google Scholar 

  9. Neal Koblitz. A Course in Number Theory and Cryptography. GTM No. 114. New York: Springer Verlag, second edition, 1994.

    MATH  Google Scholar 

  10. L. Lovász, J. Pelikán, and K. Vesztergombi. Discrete Mathematics. Elementary and Beyond. Undergraduate Texts in Mathematics. New York: Springer, first edition, 2003.

    Google Scholar 

  11. Alfred J. Menezes, Paul C. van Oorschot, and Scott A. Vanstone. Handbook of Applied Cryptography. Boca Raton, FL: CRC Press, fifth edition, 2001.

    Google Scholar 

  12. Ivan Niven, Herbert S. Zuckerman, and Hugh L. Montgomery. An Introduction to the Theory of Numbers. New York: Wiley, fifth edition, 1991.

    Google Scholar 

  13. Paulo Ribenboim. The Little Book of Bigger Primes. New York: Springer-Verlag, second edition, 2004.

    MATH  Google Scholar 

  14. R.L. Rivest, A. Shamir, and L. Adleman. A method for obtaining digital signatures and public-key cryptosystems. Communications of the ACM, 21(2):120–126, 1978.

    Article  MATH  MathSciNet  Google Scholar 

  15. Joseph H. Silverman. A Friendly Introduction to Number Theory. Upper Saddle River, NJ: Prentice Hall, third edition, 2006.

    Google Scholar 

  16. Patrick Suppes. Axiomatic Set Theory. New York: Dover, first edition, 1972.

    MATH  Google Scholar 

  17. André Weil. Number Theory. An Approach Through History from Hammurapi to Legendre. Boston: Birkhauser, first edition, 1987.

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer and Information Science, University of Pennsylvania, 3330 Walnut Street, 19104, Philadelphia, PA, USA

    Jean Gallier

Authors
  1. Jean Gallier
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Jean Gallier .

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer Science+Business Media, LLC

About this chapter

Cite this chapter

Gallier, J. (2011). Partial Orders, Lattices, Well-Founded Orderings, Unique Prime Factorization in ℤ and GCDs, Equivalence Relations, Fibonacci and Lucas Numbers, Public Key Cryptography and RSA, Distributive Lattices, Boolean Algebras, Heyting Algebras. In: Discrete Mathematics. Universitext. Springer, New York, NY. https://doi.org/10.1007/978-1-4419-8047-2_5

Download citation

Publish with us

Policies and ethics

Search

Navigation