Combinatorics (Fall 2010): Difference between revisions
Jump to navigation
Jump to search
imported>WikiSysop No edit summary |
imported>WikiSysop No edit summary |
||
Line 31: | Line 31: | ||
|header6 = | |header6 = | ||
|label6 = Class meetings | |label6 = Class meetings | ||
|data6 = | |data6 = 10am -12am, Friday | ||
|header7 = | |header7 = | ||
|label7 = Place | |label7 = Place |
Revision as of 11:20, 30 June 2010
This is the page for the class Combinatorics for the Fall 2010 semester. Students who take this class should check this page periodically for content updates and new announcements.
Announcement
- There is no announcement yet.
Syllabus
先修课程 Prerequisites
- 离散数学(Discrete Mathematics)
- 线性代数(Linear Algebra)
- 概率论(Probability Theory)
Course materials
Policies
Assignments
- There is no assignment yet.
Lecture Notes
A tentative list of topics:
- Basic enumeration
- Permutations and sieves
- Generating functions
- The probabilistic method
- Random graphs
- Extremal graph theory
- Finite set systems
- Extremal set theory
- Ramsey theory
- Optimization
- Duality
- Flow and matching
- Matroid
- Spectra of graphs
- Harmonic analysis of boolean functions
- The Szemeredi regularity lemma
- Sum-product theorems, Kakeya set