Please note: the instructor and course information changes from semester to semester for this course number. Specifics for each semester below.
Spring 2018
Shubhangi Saraf
Subtitle:
Algebraic gems in discrete mathematics and theoretical computer science
Course Description:
In the last few decades, algebraic methods have proven to be extremely powerful in several areas of discrete mathematics and theoretical computer science. Many of these important advances in the field have relied on very simple properties of polynomials. In this course we will see many interesting and often surprising applications of linear algebra and polynomials to combinatorics, discrete geometry, complexity theory and algorithm design. We will develop all the algebraic tools that we need along the way.
Text:
none
Prerequisites:
Basic combinatorics/discrete math, basic linear algebra, mathematical maturity
**************************************************************************************
Fall 2017
Jeffry Kahn
Subtitle:
Extremal Combinatorics
Course Description:
The term "Extremal Combinatorics" covers many of the most significant discrete developments of recent (and less recent) years, and many of the most interesting open problems. We'll sample some of these, trying to emphasize the wide range of ideas, methods and extra-combinatorial machinery that come into play.
Text:
None; relevant books will be on reserve.
Prerequisites:
There are no formal prerequisites but it will help to have at least seen the combinatorics sequence, 642.582-3. I'll try to fill in background as we go along. Check with me if in doubt.
