CMSC-203 Discrete Math: Supplemental Reading (spring 2001)

I have requested that Kuhn Library place each of the following books on reserve:

Discrete Math Texts

  1. Epp, Susan, Discrete Mathematics with Applications, Brooks/Cole (1995).

  2. Anderson, James A., Discrete Mathematics with Combinatorics, Prentice Hall (2001).

  3. Biggs, Norman, Discrete Mathematics, Claredon Press (1989). [Text for CMSC-603 Discrete Math.]

  4. Ross, Kenneth A., and Charles R. B. Wright, Discrete Mathematics, Prentice Hall (1999), fourth edition.

  5. Scheinerman, Edward R., Mathematics: A Discrete Introduction, Brooks/Cole (1999). [Chapter 16 on Inclusion-Exclusion is required.]

  6. Truss, J. K., Discrete Mathematics for Computer Scientists, Addison-Wesley (1991). [See Sections 3.5 and 4.2 for Burnside's Lemma (optional).]

Sections from Other Books (highly recommended)

  1. Brassard, Gilles, and Paul Bratley, "Section 4.7: Solving Recurrences" in Fundamentals of Algorithmics, Prentice Hall (1996), second edition.

  2. Cormen, Thomas, Charles E. Leiserson, and Ronald L. Rivest, "Part I: Mathematical Foundations" in Introduction to Algorithms, MIT Press and McGraw Hill (1992?), second edition.

  3. Knuth, Donald, "Section 1.2 Mathematical Preliminaries" in Fundamental Algorithms in The Art of Computer Programming, vol. I, Addison-Wesley (1973).

  4. Lewis, Harry R., and Christos H. Papadimitriou, ``Chapter 1: Sets, Relations, and Languages'' in Elements of the Theory of Computation, Prentice Hall (1981), 1-48.

  5. Munkres, James R., ``Chapter 1: Set Theory and Logic'' in Topology: A First Course, Prentice Hall (1975), pp. 3-74.

Books on Specialized Topics

  1. Apostol, Tom M., Calculus: One-Variable Calculus, with an Introduction to Linear Algebra, vol. I, John Wiley (1967). [Rigorous proofs of The Calculus.]

  2. Char, Bruce W., K. Geddes, G. Gonnet, B. Leong, M. Monagan, and S. Watt, First Leaves: A Tutorial Introduction to Maple V, Springer-Verlag (1992).

  3. Enderton, Herbert B., A Mathematical Introduction to Logic, Academic Press (1972).

  4. Epstein, Richard A., The Theory of Gambling and Statistical Logic, Academic Press (1977).

  5. Feller, William, An Introduction to Probability Theory and its Applications, vol.\ I, John Wiley (1968).

  6. Herstein, I. N., Topics in Algebra, John Wiley (1964).

  7. LeVeque, Fundamentals of Number Theory, Addison-Wesley (1977).

  8. Packel, Edward, The Mathematics of Games and Gambling, Mathematical Association of America, New Mathematical Library 28 (1966).

  9. Roberts, Fred S., Applied Combinatorics, Prentice-Hall (1984).

How To's

  1. Cupillari, Antonella, The Nuts and Bolts of Proofs, Wadsworth (1989).

  2. Higham, Nicholas J., Handbook of Writing for the Mathematical Sciences, SIAM (Philadelphia, 1993).

  3. Polya, G., How to Solve it: A New Aspect of Mathematical Method, Princeton University Press (1973).

  4. Solow, Daniel, How to Read and Do Proofs: An Introduction to Mathematical Thought Process, John Wiley (1990).