Algorithmic Combinatorics
Summer Semester 2012
General Information
E-mail: jsellers@risc.jku.at
or jxs23@psu.edu
Textbook: The following texts may prove beneficial for this
course.
- A. Tucker, Applied Combinatorics
- R. Graham, D. Knuth, and O. Patashnik, Concrete Mathematics
- R. Stanley, Enumerative Combinatorics, Volumes I and II
- A. Benjamin and J. Quinn, Proofs That Really Count
- D. Stanton and D. White, Constructive Combinatorics
- A. Kerber, Finite Group Actions
Overseer of Exercise Sessions
Silviu Radu
Key
Topics and Concepts
My goal for the course is to cover a wide variety of topics including
the following:
- Fundamental Notions Related to Enumerative Combinatorics
(Lists/Permutations, Sets/Combinations, Special Bijections, etc.)
- The Twelve-fold Way of Counting
- Integer Partitions
- Finite Group Actions
- The Cauchy-Frobenius Lemma
Grading
Grades in this course will be assigned based on a written final
examination which will be administered at the end of the semester.
Class
Attendance
Although regular classroom attendance will not figure into your grade
in a tangible way, I strongly encourage your regular attendance in this
class. It should be obvious that attending all classes is extremely
beneficial
to you. Seeing the material presented in a lecture is extremely
helpful. Having questions answered in class
(as well as hearing other students' questions) is also a benefit.