Math 118
Combinatorics
Last updated June 27, 2016 13:25:41 EDT
General Information
No textbook required for this course. The material will be taken from a combination of notes, research papers, and the following books:
- [AE] G. Andrews, K. Eriksson, Integer partitions, Cambridge University Press, 2004.
- [An] G. Andrews, The theory of partitions, Cambridge University Press, 1984.
- [Br] D. Bressoud, Proofs and Confirmations. The Story of the Alternating Sign Matrix Conjecture, Cambridge University Press, 1999.
- [EC] R. Stanley, Enumerative Combinatorics, Vols. I and II. An online version Vol. I is available here.
- [BS] A. Björner, R. Stanley, A Combinatorial Miscellany, available here.
- [Zi] G. M. Ziegler, Lectures on Polytopes, Graduate Texts in Mathematics 152, Springer-Verlag, New York 1995.
- [Wa] M. Wachs, Poset Topology: Tools and Applications, Geometric combinatorics, 497-615, IAS/Park City Math. Ser., 13, Amer. Math. Soc., Providence, RI, 2007. Available here.
MWF 12:30 - 1:35 |
Kemeny 004 |
|
Sergi Elizalde |
Office: 332 Kemeny Hall |
Office Hours: Mon 1:40-3:30, Wed 11:10-12:20 |
Phone: 646-8191 or
email (preferred) |
There will be no exams for this course.
The course grade will be based on the homework (60%) and a presentation in class (40%).
- Homework will be assigned roughly every other week.
- Collaboration on the homework is encouraged, but the solutions must be written individually.
- Please mention on your problem set the names of the students that you worked with, and also reference any articles, books or websites if your solution takes significant ideas from them.
Students with disabilities who will be taking this course and may need
disability-related classroom accommodations are encouraged to make an
appointment to see their instructor as soon as possible. Also, they
should stop by the
Academic Skills Center
in Collis Center to register for support services.
Last updated June 27, 2016 13:25:41 EDT