This preview has intentionally blurred sections. Sign up to view the full version.View Full Document
Unformatted text preview: MATH 475 SYLLABUS, Fall Semester, 2007–08 Academic Year Lec. 1, TR 9:30–10:45 AM, B105 Van Vleck Hall Prof. Richard A. Brualdi Text is: Office: 725 Van Vleck Hall Introductory Combinatorics 5th ed.NOTES, by R.A. Brualdi Tel: 262-3298; E-mail: [email protected] Office Hours: Mon (3:30–4:30PM), Tues. (3:00–4:00PM), Thur. (1:00–2:00PM) WWW: http://www.math.wisc.edu/˜brualdi I will be distributing pdf files of updated chapters of the above book. Copies of the 4edition of text are on reserve in the Math Library (level B2 of Van Vleck Hall) if you want to check some of your answers to the exercises. Course Description As the title Introduction to Combinatorics suggests, Math 475 is a first course with emphasis on the basics of combinatorial counting techniques, number sequences, patterns, and ordered sets. It is not however a course on what is traditionally called discrete mathematics. But we will discuss algorithms for some of the combinatorial problems considered. Briefly, the topics covered in the course this semester include: pigeon-hole principle and applications; permutations and combinations; generating permutations and combinations; properties of binomial coefficients (combination numbers); partial orders, equivalence rela- tions, and Dilworth’s theorem; the inclusion-exclusion principle; recurrence relations and generating functions; difference sequences, Catalan numbers, Stirling numbers, partition numbers, and other counting sequences; systems of distinct representatives (marriage theo-...
View Full Document
This note was uploaded on 08/11/2008 for the course MATH 475 taught by Professor Balazs during the Fall '05 term at University of Wisconsin.
- Fall '05