Combinatorics (Fall 2010): Difference between revisions

From TCS Wiki
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

组合数学 Combinatorics
Instructor
尹一通
Email 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.
v · d · e

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:

  1. Basic enumeration
  2. Permutations and sieves
  3. Generating functions
  4. The probabilistic method
  5. Random graphs
  6. Extremal graph theory
  7. Finite set systems
  8. Extremal set theory
  9. Ramsey theory
  10. Optimization
  11. Duality
  12. Flow and matching
  13. Matroid
  14. Spectra of graphs
  15. Harmonic analysis of boolean functions
  16. The Szemeredi regularity lemma
  17. Sum-product theorems, Kakeya set