Fall 2023
Jeffry Kahn
Course Description:
This is the first part of a two-semester course surveying basic topics in combinatorics. Topics for the full year should include (at least) those below.
Enumeration (basics, generating functions, recurrence relations, inclusion-exclusion, asymptotics)
Matching theory, polyhedral and fractional issues
Partially ordered sets and lattices, Mobius functions
Theory of finite sets and hypergraphs, combinatorial discrepancy, Ramsey theory, correlation inequalities
Probabilistic methods
Algebraic and Fourier methods
Entropy methods
Text:
van Lint-Wilson (optional; there is no real text, and we will appeal to appropriate references)
Prerequisites:
There are no formal prerequisites, but the course assumes a level of mathematical maturity consistent with having taken serious undergraduate courses in linear algebra and/or real analysis. (Basic linear algebra will be helpful, real analysis less so; it will be good to have seen at least a little combinatorics.) Check with me if in doubt.
*********************************************
Fall 2022
Bhargav Narayanan
Course Description:
This is the first part of a two-semester course surveying basic topics in combinatorics.
Topics for the full year (582 and 583) should include most of the following, along side selected recent developments.
Enumeration: basics, generating functions, recurrence relations, inclusion-exclusion, asymptotics
Matching theory, polyhedral and fractional issues
Partially ordered sets and lattices, Mobius functions
Theory of finite sets: isoperimetry, intersecting families, and related topics
Combinatorial discrepancy
Correlation inequalities
Ramsey theory
Probabilistic methods
Algebraic and Fourier methods
Entropy Methods
Text:
van Lint-Wilson/Bollobas is nice but optional. There is really no text; various relevant books will be on reserve.
Prerequisites:
There are no formal prerequisites, but the course assumes a level of mathematical maturity consistent with having had good courses in linear algebra (such as 640:350) and real analysis (such as 640:411) at the undergraduate level. It will help to have seen at least a little prior combinatorics, and (very) rudimentary probability will also occasionally be useful. See me if in doubt.
*********************************************
Fall 2021
Bhargav Narayanan
Course Description:
This is the first part of a two-semester course surveying basic topics in combinatorics.
Topics for the full year (582 and 583) should include most of the following, along side selected recent developments.
Enumeration: basics, generating functions, recurrence relations, inclusion-exclusion, asymptotics
Matching theory, polyhedral and fractional issues
Partially ordered sets and lattices, Mobius functions
Theory of finite sets: isoperimetry, intersecting families, and related topics
Combinatorial discrepancy
Correlation inequalities
Ramsey theory
Probabilistic methods
Algebraic and Fourier methods
Entropy Methods
Text:
van Lint-Wilson/Bollobas is nice but optional. There is really no text; various relevant books will be on reserve.
Prerequisites:
There are no formal prerequisites, but the course assumes a level of mathematical maturity consistent with having had good courses in linear algebra (such as 640:350) and real analysis (such as 640:411) at the undergraduate level. It will help to have seen at least a little prior combinatorics, and (very) rudimentary probability will also occasionally be useful. See me if in doubt.
Schedule of Sections:
Previous Semesters:
- Fall 2020 Prof. Kahn
- Fall 2019 Prof. Kahn
- Fall 2018 Prof. Beck
- Fall 2017 Prof. Kopparty
- Fall 2016 Prof. Kahn
- Fall 2015 Prof. Kahn
- Fall 2014 Prof. M. Saks
- Fall 2013 Prof. Kahn
- Fall 2012 Prof. Kopparty
- Fall 2011 Prof. Kahn
Fall 2017
Swastik Kopparty
Text:
None
Prerequisites:
Some algebra (especially linear algebra), some discrete probability, and mathematical maturity.
Description:
This will be a basic introduction to combinatorics at the graduate level.
We will cover topics such as enumeration, symmetry, partial orders, set systems, Ramsey theory, discrepancy, additive combinatorics and quasirandomness. There will be emphasis on general techniques, including probabilistic methods, linear-algebra methods, analytic methods, topological methods and geometric methods.
