Combinatorics (Fall 2010): Difference between revisions
Jump to navigation
Jump to search
imported>WikiSysop |
imported>WikiSysop |
||
| Line 80: | Line 80: | ||
A tentative list of topics: | A tentative list of topics: | ||
# [[Combinatorics (Fall 2010)/Basic enumeration|Basic enumeration]] | [http://lamda.nju.edu.cn/yinyt/notes/comb2010/comb1.pdf slides] | # [[Combinatorics (Fall 2010)/Basic enumeration|Basic enumeration]] | [http://lamda.nju.edu.cn/yinyt/notes/comb2010/comb1.pdf slides] | ||
# [[Combinatorics (Fall 2010)/ | # [[Combinatorics (Fall 2010)/Partitions, sieve methods|Partitions, Sieve methods]] | ||
# [[Combinatorics (Fall 2010)/Generating functions|Generating functions]] | # [[Combinatorics (Fall 2010)/Generating functions|Generating functions]] | ||
# [[Combinatorics (Fall 2010)/The probabilistic method|The probabilistic method]] | # [[Combinatorics (Fall 2010)/The probabilistic method|The probabilistic method]] | ||
Revision as of 23:43, 8 September 2010
 | |
| Instructor | |
|---|---|
| 尹一通 | |
| yitong.yin@gmail.com yinyt@nju.edu.cn yinyt@lamda.nju.edu.cn | |
| office | 蒙民伟楼 406 |
| Class | |
| Class meetings |
10am -12am, Friday, 馆I-105 |
| Office hours | 2pm-5pm, Saturday, MMW 406 |
| Textbook | |
|
van Lint and Wilson, A course in Combinatorics, 2nd Ed, Cambridge Univ Press, 2001. | |
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
- 9月3日第一次课。时间：上午三、四节；地点：馆I-105。
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 | slides
- Partitions, Sieve methods
- 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