MAT 481 -- Discrete Mathematics
Course Information
Professor: D. Bradley
E-mail: bradley@math.maine.edu
or David Bradley (First Class)
Website: http://www.umemat.maine.edu/faculty/bradley/index.html
Note: Students with disabilities for which they may be requesting accomodation are advised to contact Ann Smith, Coordinator of Services for Students with Disabilities (Onward Building, 581-2319), as early as possible in the term.
Text: Concrete Mathmatics, 2nd ed. by Ronald Graham, Donald Knuth, and Oren Patashnik, Addison-Wesley,
1994.
Syllabus:
- Recursion
- Sums
- Binomial Coefficients
- Generating Functions
- Hypergeometric Functions
- Stirling, Bernoulli, Euler(ian), and Harmonic Numbers
- Analysis of Algorithms, Asymptotics
- Enumerative Combinatorics
- Graph Theory
- Trees, Flows and Networks
- Gray Codes, Hamilton Cycles, Euler Tours
- The Assignment Problem & Perfect Matchings
- Permanents
- Chromatic Polynomials
- Turing Machines
We'll concentrate on Chapters 1, 2, 5, 6, 7, and 9. The additional
material will be covered as time permits.
*Of course, you are welcome to drop
by the office any time, or make an appointment.