Greg Constantine: Discrete Mathematics
This page offers information on the graduate course in Combinatorial
Theory that I teach from time to time. The book I use is written
by
yours truly
and it appears in the Wiley series;
it is titled Combinatorial Theory and
Statistical Design. I shall cover all nine chapters.
Recent extensions of two classical theorems will also be presented. There
will be
opportunities to use any programming knowledge that one might have. I am
inclined to rely on Mathematica and Splus for most computational needs and
to use Fortran or C for programming.
It is useful to be acquainted with finite groups and fields, vector spaces,
and
the prime
numbers less than 100. However, these are not required
prerequisites for the course.
If you think you might enjoy exotic finite objects (as well as the chase
for such objects), fun enumeration techniques, deep connections between
arithmetic and existence of certain symmetric codes and designs, you will
find this course a real scream. Hold on to your hat and click any of the
following: