组合数学 (Fall 2017): Difference between revisions

From TCS Wiki
Jump to navigation Jump to search
imported>Etone
Created page with "{{Infobox |name = Infobox |bodystyle = |title = <font size=3>组合数学 <br> Combinatorics</font> |titlestyle = |image = |imagestyle = |ca..."
 
imported>Etone
No edit summary
Line 37: Line 37:
|header8 =
|header8 =
|label8  = Office hours
|label8  = Office hours
|data8  = TBA <br>计算机系 804
|data8  = Monday 2-4pm <br>计算机系 804
|header9 = Textbook
|header9 = Textbook
|label9  =  
|label9  =  
Line 60: Line 60:


= Announcement =
= Announcement =
* (2017/9/4) 新学期第一次上课。


= Course info =
= Course info =
Line 66: Line 67:
:*office: 804
:*office: 804
* '''Class meeting''': Monday 10am, 仙II-504.
* '''Class meeting''': Monday 10am, 仙II-504.
* '''Office hour''': TBA, 计算机系 804.
* '''Office hour''': Monday 2-4pm, 计算机系 804.


= Syllabus =
= Syllabus =
Line 95: Line 96:


= Lecture Notes =
= Lecture Notes =
# Introduction | 课程简介
# [[组合数学 (Fall 2017)/Basic enumeration|Basic enumeration | 基本计数]] ( [http://tcs.nju.edu.cn/slides/comb2017/BasicEnumeration.pdf slides])
# [[组合数学 (Fall 2017)/Basic enumeration|Basic enumeration | 基本计数]]
# [[组合数学 (Fall 2017)/Generating functions|Generating functions | 生成函数]]
# [[组合数学 (Fall 2017)/Generating functions|Generating functions | 生成函数]]
# [[组合数学 (Fall 2017)/Sieve methods|Sieve methods | 筛法]]
# Pólya's theory of counting | Pólya计数法
# [[组合数学 (Fall 2017)/Cayley's formula|Cayley's formula | Cayley公式]]
# Sieve methods | 筛法
# [[组合数学 (Fall 2017)/Pólya's theory of counting|Pólya's theory of counting | Pólya计数法]]
# Cayley's formula | Cayley公式
# [[组合数学 (Fall 2017)/Existence problems|Existence problems | 存在性问题]]
# Existence problems | 存在性问题
# [[组合数学 (Fall 2017)/The probabilistic method|The probabilistic method | 概率法]]
# The probabilistic method | 概率法
# [[组合数学 (Fall 2017)/Extremal graph theory|Extremal graph theory | 极值图论]]
# Extremal graph theory | 极值图论
# [[组合数学 (Fall 2017)/Extremal set theory|Extremal set theory | 极值集合论]]
# Extremal set theory | 极值集合论
# [[组合数学 (Fall 2017)/Ramsey theory|Ramsey theory | Ramsey理论]]
# Ramsey theory | Ramsey理论
# [[组合数学 (Fall 2017)/Matching theory| Matching theory | 匹配论]]
# Matching theory | 匹配论
 
= Concepts =
* [http://en.wikipedia.org/wiki/Binomial_coefficient Binomial coefficient]
* [http://en.wikipedia.org/wiki/Twelvefold_way The twelvefold way]
* [http://en.wikipedia.org/wiki/Composition_(number_theory) Composition of a number]
* [http://en.wikipedia.org/wiki/Multiset#Formal_definition Multiset]
* [http://en.wikipedia.org/wiki/Combination#Number_of_combinations_with_repetition Combinations with repetition], [http://en.wikipedia.org/wiki/Multiset#Counting_multisets <math>k</math>-multisets on a set]
* [http://en.wikipedia.org/wiki/Multinomial_theorem#Multinomial_coefficients Multinomial coefficients]
* [http://en.wikipedia.org/wiki/Stirling_numbers_of_the_second_kind Stirling number of the second kind]
* [http://en.wikipedia.org/wiki/Partition_(number_theory) Partition of a number]
** [http://en.wikipedia.org/wiki/Young_tableau Young tableau]
* [http://en.wikipedia.org/wiki/Fibonacci_number Fibonacci number]
* [http://en.wikipedia.org/wiki/Catalan_number Catalan number]
* [http://en.wikipedia.org/wiki/Generating_function Generating function] and [http://en.wikipedia.org/wiki/Formal_power_series formal power series]
* [http://en.wikipedia.org/wiki/Binomial_series Newton's formula]

Revision as of 09:03, 12 September 2017

组合数学
Combinatorics
Instructor
尹一通
Email yitong.yin@gmail.com yinyt@nju.edu.cn
office 计算机系 804
Class
Class meetings Monday, 10am
仙II-504
Office hours Monday 2-4pm
计算机系 804
Textbook
van Lint and Wilson.
A course in Combinatorics, 2nd ed.,
Cambridge Univ Press, 2001.
Jukna. Extremal Combinatorics:
With Applications in Computer Science,
2nd ed.
, Springer, 2011.
v · d · e

This is the webpage for the Combinatorics class of fall 2017. Students who take this class should check this page periodically for content updates and new announcements.

Announcement

  • (2017/9/4) 新学期第一次上课。

Course info

  • Instructor : 尹一通
  • email: yitong.yin@gmail.com, yinyt@nju.edu.cn,
  • office: 804
  • Class meeting: Monday 10am, 仙II-504.
  • Office hour: Monday 2-4pm, 计算机系 804.

Syllabus

先修课程 Prerequisites

  • 离散数学(Discrete Mathematics)
  • 线性代数(Linear Algebra)
  • 概率论(Probability Theory)

Course materials

成绩 Grades

  • 课程成绩:本课程将会有若干次作业和一次期末考试。最终成绩将由平时作业成绩和期末考试成绩综合得出。
  • 迟交:如果有特殊的理由,无法按时完成作业,请提前联系授课老师,给出正当理由。否则迟交的作业将不被接受。

学术诚信 Academic Integrity

学术诚信是所有从事学术活动的学生和学者最基本的职业道德底线,本课程将不遗余力的维护学术诚信规范,违反这一底线的行为将不会被容忍。

作业完成的原则:署你名字的工作必须由你完成。允许讨论,但作业必须独立完成,并在作业中列出所有参与讨论的人。不允许其他任何形式的合作——尤其是与已经完成作业的同学“讨论”。

本课程将对剽窃行为采取零容忍的态度。在完成作业过程中,对他人工作(出版物、互联网资料、其他人的作业等)直接的文本抄袭和对关键思想、关键元素的抄袭,按照 ACM Policy on Plagiarism的解释,都将视为剽窃。剽窃者成绩将被取消。如果发现互相抄袭行为, 抄袭和被抄袭双方的成绩都将被取消。因此请主动防止自己的作业被他人抄袭。

学术诚信影响学生个人的品行,也关乎整个教育系统的正常运转。为了一点分数而做出学术不端的行为,不仅使自己沦为一个欺骗者,也使他人的诚实努力失去意义。让我们一起努力维护一个诚信的环境。

Assignments

Lecture Notes

  1. Basic enumeration | 基本计数slides
  2. Generating functions | 生成函数
  3. Pólya's theory of counting | Pólya计数法
  4. Sieve methods | 筛法
  5. Cayley's formula | Cayley公式
  6. Existence problems | 存在性问题
  7. The probabilistic method | 概率法
  8. Extremal graph theory | 极值图论
  9. Extremal set theory | 极值集合论
  10. Ramsey theory | Ramsey理论
  11. Matching theory | 匹配论

Concepts