Meetings: MWF 3:10-4:00 PM, Wickson Hall 1020
Instructor: Prof. Jesús A. De Loera.
email: deloera@math.ucdavis.edu
URL: http://www.math.ucdavis.edu/~deloera/TEACHING/MATH245/enumcombinat.html
Phone: (530)-754 70 29
Office hours: TBA or by appointment. My office is 3228 Mathematical Sciences Building.
Text and References: The classic book ``Enumerative Combinatorics'' Volume I, by Richard P. Stanley. I will supplement it with my own notes and exercises.
Description: The objective of this
course is simply to teach you how to count (and you thought you knew since kindergarden, eh?). Indeed, enumerative combinatorics is the art of counting the number of elements of a finite set. It contains now a well-established set of
tools and structures that help on carrying an exact count or how to
make educated estimations. Here is an outline of the course:
1) Basic combinatorial enumeration (Permutations, Sets, MultiSets, partitions, and the Twelvefold way) and generating functions. (Chapter 1)
2) Posets, lattices and Moebius Inversion, Involutions and the Inclusion-Exclusion Principle. (Chapters 2,3)
3) Rational generating functions. (chapter 4).
Grading policy and Rules:
FIRST MIDTERM: will contain material from Stanley EC1 Chapter 1 (i.e. homeworks 1 and 2).
Here are most solutions for homework1 and that of the nasty problem 2.c of Stanley's book.
Here are most solutions for homework2.
SECOND MIDTERM: Will contain material from Stanley EC1 Chapters 2 and 3 (i.e. homeworks 3 and 4).
Here are the computer slides for my introduction to section 4.6.