Combinatorics (Fall 2010): Difference between revisions
Jump to navigation
Jump to search
imported>WikiSysop m Protected "Combinatorics (Fall 2010)" ([edit=sysop] (indefinite) [move=sysop] (indefinite)) |
imported>WikiSysop |
||
Line 80: | Line 80: | ||
= Lecture Notes = | = Lecture Notes = | ||
A tentative list of topics: | A tentative list of topics: | ||
# Basic enumeration | # [[Combinatorics (Fall 2010)/Basic enumeration|Basic enumeration]] | ||
# Permutations and sieves | # Permutations and sieves | ||
# Generating functions | # Generating functions |
Revision as of 01:53, 8 July 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.
Course info
- Instructor : 尹一通,
- email: yitong.yin@gmail.com, yinyt@nju.edu.cn, yinyt@lamda.nju.edu.cn
- office: MMW 406.
- Class meeting: 10am-12 am, Friday; 馆I-105.
- Office hour: 2-5pm, Saturday; MMW 406.
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