imported>Haimin |
imported>TCSseminar |
Line 2: |
Line 2: |
| |name = Infobox | | |name = Infobox |
| |bodystyle = | | |bodystyle = |
| |title = <font size=3>组合数学 <br> | | |title = <font size=3>计算复杂性 |
| Combinatorics</font>
| | <br>Computational Complexity</font> |
| |titlestyle = | | |titlestyle = |
|
| |
|
Line 19: |
Line 19: |
| |header2 = | | |header2 = |
| |label2 = | | |label2 = |
| |data2 = 尹一通 | | |data2 = 姚鹏晖 |
| |header3 = | | |header3 = |
| |label3 = Email | | |label3 = Email |
| |data3 = yitong.yin@gmail.com yinyt@nju.edu.cn | | |data3 = pyao@nju.edu.cn |
| |header4 = | | |header4 = |
| |label4= office | | |label4= Office |
| |data4= 计算机系 804 | | |data4= 计算机系 502 |
| |header5 = Class | | |header5 = Class |
| |label5 = | | |label5 = |
Line 31: |
Line 31: |
| |header6 = | | |header6 = |
| |label6 = Class meetings | | |label6 = Class meetings |
| |data6 = Wednesday, 2pm-4pm <br> 仙I-319 | | |data6 = Thursday, 18:30-20:20 <br> 仙II-214 |
| |header7 = | | |header7 = |
| |label7 = Place | | |label7 = Place |
Line 37: |
Line 37: |
| |header8 = | | |header8 = |
| |label8 = Office hours | | |label8 = Office hours |
| |data8 = Wednesday, 4pm-6pm <br>计算机系 804 | | |data8 = Thursday, 14:00-16:00 <br>计算机系 502 |
| |header9 = Textbook | | |header9 = Textbooks |
| |label9 = | | |label9 = |
| |data9 = | | |data9 = |
| |header10 = | | |header10 = |
| |label10 = | | |label10 = |
| |data10 = [[File:LW-combinatorics.jpeg|border|100px]] | | |data10 = https://image.ibb.co/drYZEp/51_KWx_I1yyy_L.jpg |
| |header11 = | | |header11 = |
| |label11 = | | |label11 = |
| |data11 = van Lint and Wilson. <br> ''A course in Combinatorics, 2nd ed.'', <br> Cambridge Univ Press, 2001. | | |data11 = Arora and Barak. <br>''Computational Complexity: A Modern Approach''.<br> Cambridge Univ Press, 2009. |
| |header12 = | | |header12 = Teaching Assistant |
| |label12 = | | |data13= 刘明谋 |
| |data12 = [[File:Jukna_book.jpg|border|100px]] | | |label14=Email |
| |header13 = | | |data14=liu.mingmou@smail.nju.edu.cn |
| |label13 = | | |label15=Office |
| |data13 = Jukna. ''Extremal Combinatorics: <br> With Applications in Computer Science,<br>2nd ed.'', Springer, 2011. | | |data15=计算机系 410 |
| |belowstyle = background:#ddf; | | |belowstyle = background:#ddf; |
| |below = | | |below = |
| }} | | }} |
|
| |
|
| This is the webpage for the ''Combinatorics'' class of fall 2019. Students who take this class should check this page periodically for content updates and new announcements.
| | |
|
| |
|
| = Announcement = | | = Announcement = |
| * (2019/9/6) 第一课的lecture notes和slides已经发布。 | | * (2019/9/5) 新学期第一堂课。 |
| * (2019/10/21)外网数学符号显示已经正常。 | | * (2019/9/5) 交流及授课反馈群: 854081425 [https://i.ibb.co/cN3ydT6/2019.png QRcode](助教出差中,有问题可以到qq群问或者邮件询问。qq群仅作讨论用,所有的通知及资料仍在本页面发放) |
| * (2019/11/04)<font color=red size=4>11月6日按原定计划上习题课。教服系统中的“停课”指的是:正常新内容的授课暂停一次,原授课时间段改为上习题课。</font> | | * (2019/9/17) 第一次作业已发布,9月26日之前交。 |
| | * (2019/9/26) 第二次作业已发布,10月10日上课前交。 |
| | * (2019/9/29) 第二次作业的 3.8 题目有错,把题目第一行的 unary 一词删去。 |
| | * (2019/10/7) 第一次作业已批阅发回,参考答案及评分标准已发布。 |
| | * (2019/10/11) 第三次作业已发布,10月24日上课前交。 |
|
| |
|
| = Course info = | | = Course info = |
| * '''Instructor ''': 尹一通 ([http://tcs.nju.edu.cn/yinyt/ homepage]) | | * '''Instructor ''': 姚鹏晖 ([mailto:pyao@nju.edu.cn pyao@nju.edu.cn]) |
| :*email: yinyt@nju.edu.cn
| | * '''Teaching assistant''': 刘明谋 ([mailto:liu.mingmou@smail.nju.edu.cn liu.mingmou@smail.nju.edu.cn]) |
| :*office: 804
| | * '''Class meeting''': Thursday, 18:30-20:20 仙II-214. |
| * '''Teaching assistant''': 陈海敏 ([mailto:ichenhm@gmail.com email], [http://tcs.nju.edu.cn/files/people/haimin/ homepage]),蒋圣翊 ([mailto:shengyi.jiang@outlook.com email], [http://www.lamda.nju.edu.cn/jiangsy/ homepage]) | | * '''Office hour''': Thursday, 14:00-16:00, 计算机系 502. |
| * '''Class meeting''': Wednesday, 2pm-4pm, 仙I-319. | |
| * '''Office hour''': Wednesday, 4pm-6pm, 计算机系 804. | |
| | |
| = Syllabus =
| |
| | |
| === 先修课程 Prerequisites ===
| |
| * 离散数学(Discrete Mathematics)
| |
| * 线性代数(Linear Algebra)
| |
| * 概率论(Probability Theory)
| |
| | |
| === Course materials ===
| |
| * [[组合数学 (Fall 2019)/Course materials|<font size=3>教材和参考书清单</font>]]
| |
| | |
| === 成绩 Grades ===
| |
| * 课程成绩:本课程将会有若干次作业和一次期末考试。最终成绩将由平时作业成绩 (≥ 60%) 和期末考试成绩 (≤ 40%) 综合得出。
| |
| * 迟交:如果有特殊的理由,无法按时完成作业,请提前联系授课老师,给出正当理由。否则迟交的作业将不被接受。
| |
| | |
| === <font color=red> 学术诚信 Academic Integrity </font>===
| |
| 学术诚信是所有从事学术活动的学生和学者最基本的职业道德底线,本课程将不遗余力的维护学术诚信规范,违反这一底线的行为将不会被容忍。
| |
|
| |
|
| 作业完成的原则:署你名字的工作必须是你个人的贡献。在完成作业的过程中,允许讨论,前提是讨论的所有参与者均处于同等完成度。但关键想法的执行、以及作业文本的写作必须独立完成,并在作业中致谢(acknowledge)所有参与讨论的人。不允许其他任何形式的合作——尤其是与已经完成作业的同学“讨论”。
| | = Course materials = |
| | | * [https://www.amazon.com/dp/0521424267 Arora and Barak. Computational Complexity: A Modern Approach. Cambridge Univ Press, 2009.] |
| 本课程将对剽窃行为采取零容忍的态度。在完成作业过程中,对他人工作(出版物、互联网资料、其他人的作业等)直接的文本抄袭和对关键思想、关键元素的抄袭,按照 [http://www.acm.org/publications/policies/plagiarism_policy ACM Policy on Plagiarism]的解释,都将视为剽窃。剽窃者成绩将被取消。如果发现互相抄袭行为,<font color=red> 抄袭和被抄袭双方的成绩都将被取消</font>。因此请主动防止自己的作业被他人抄袭。
| | * [https://www.amazon.cn/dp/B007VXH70K/ Arora and Barak. 计算复杂性的现代方法. (英语). 世界图书出版公司. 2012.] |
| | | * [https://www.amazon.cn/dp/B018LW74IY/ Arora and Barak. 计算复杂性:现代方法. (中文翻译). 机械工业出版社. 2016.] |
| 学术诚信影响学生个人的品行,也关乎整个教育系统的正常运转。为了一点分数而做出学术不端的行为,不仅使自己沦为一个欺骗者,也使他人的诚实努力失去意义。让我们一起努力维护一个诚信的环境。
| | 如果在获取教材方面有困难可以联系助教。(仅限英文版) |
|
| |
|
| = Assignments = | | = Assignments = |
| *[[组合数学 (Fall 2019)/Problem Set 1|Problem Set 1]] due on Sept 25, in class. [[组合数学 (Fall 2019)/作业1已提交名单 | 当前作业1已提交名单]]. | | 这是一门概念性课程,也是一门理论课程。作为理论课程,证明应该是小心、严谨的。作为概念性课程,同学们需要在作业中证明自己确实、清楚地掌握了这些概念,而不是在试图滥竽充数蒙混过关。所以在作业中请尽量不要偷懒,把每一个步骤和定义都仔细小心地写清楚,以免无意义地失分。 |
| *[[组合数学 (Fall 2019)/Problem Set 2|Problem Set 2]] due on Oct 23, in class. [[组合数学 (Fall 2019)/作业2已提交名单 | 当前作业2已提交名单]].
| | * [[计算复杂性 (Fall 2019)/Assignment 1|Assignment 1]], due on Sep 25. [[计算复杂性 (Fall 2019)/作业1已提交名单 | 作业1已提交名单]]. |
| *[http://tcs.nju.edu.cn/slides/comb2019/组合数学习题课补充最终版.pptx 组合数学补充习题讲解] | | * [https://www.overleaf.com/read/rwcjcjpxqvfn 作业1参考答案及评分标准] |
| *[[组合数学 (Fall 2019)/Problem Set 3|Problem Set 3]] due on Dec 4, in class. [[组合数学 (Fall 2019)/作业3已提交名单 | 当前作业3已提交名单]]. | | * [[计算复杂性 (Fall 2019)/Assignment 2|Assignment 2 (updated)]], due on Oct 10. [[计算复杂性 (Fall 2019)/作业2已提交名单 | 当前作业2已提交名单]]. |
| *[[组合数学 (Fall 2019)/Problem Set 4|Problem Set 4]] due on Dec 18, in class. [[组合数学 (Fall 2019)/作业4已提交名单 | 当前作业4已提交名单]]. | | * [[计算复杂性 (Fall 2019)/Assignment 3|Assignment 3]], due on Oct 24. |
|
| |
|
| = Lecture Notes = | | = Lecture Notes = |
| # [[组合数学 (Fall 2019)/Basic enumeration|Basic enumeration | 基本计数]] ( [http://tcs.nju.edu.cn/slides/comb2019/BasicEnumeration.pdf slides]) | | # 图灵机、计算复杂性类 P ([http://45.76.225.122:8000/cc_fall19/lec%201.pptx slides]) |
| # [[组合数学 (Fall 2019)/Generating functions|Generating functions | 生成函数]] ( [http://tcs.nju.edu.cn/slides/comb2019/GeneratingFunction.pdf slides])
| | # NP 和 NP 完全问题 ([http://45.76.225.122:8000/cc_fall19/lec%202.pptx slides.v2]) |
| # [[组合数学 (Fall 2019)/Sieve methods|Sieve methods | 筛法]] ( [http://tcs.nju.edu.cn/slides/comb2019/PIE.pdf slides])
| | # 对角化方法 ([http://45.76.225.122:8000/cc_fall19/lec%203.pptx slides(updated)]) |
| # [[组合数学 (Fall 2019)/Pólya's theory of counting|Pólya's theory of counting | Pólya计数法]] ( [http://tcs.nju.edu.cn/slides/comb2019/Polya.pdf slides]) | | # 空间复杂度 ([http://45.76.225.122:8000/cc_fall19/lec%204.1.pptx slides1],[http://45.76.225.122:8000/cc_fall19/lec%204.2.pptx slides2]) |
| # [[组合数学 (Fall 2019)/Cayley's formula|Cayley's formula | Cayley公式]]( [http://tcs.nju.edu.cn/slides/comb2019/Cayley.pdf slides])
| |
| # [[组合数学 (Fall 2019)/Existence problems|Existence problems | 存在性问题]] ( [http://tcs.nju.edu.cn/slides/comb2019/Existence.pdf slides])
| |
| # [[组合数学 (Fall 2019)/The probabilistic method|The probabilistic method | 概率法]]( [http://tcs.nju.edu.cn/slides/comb2019/ProbMethod.pdf slides]) | |
| # [[组合数学 (Fall 2019)/Extremal graph theory|Extremal graph theory | 极值图论]]( [http://tcs.nju.edu.cn/slides/comb2019/ExtremalGraphs.pdf slides])
| |
| # [[组合数学 (Fall 2019)/Extremal set theory|Extremal set theory | 极值集合论]]( [http://tcs.nju.edu.cn/slides/comb2019/ExtremalSets.pdf slides])
| |
| # [[组合数学 (Fall 2019)/Ramsey theory|Ramsey theory | Ramsey理论]]( [http://tcs.nju.edu.cn/slides/comb2019/Ramsey.pdf slides])
| |
| # Matching theory | 匹配论 | |
| | |
| = Resources =
| |
| * [http://math.mit.edu/~fox/MAT307.html Combinatorics course] by Jacob Fox (now at Stanford) taught at MIT and Princeton.
| |
| * [https://www.math.ucla.edu/~pak/lectures/Math-Videos/comb-videos.htm Collection of Combinatorics Videos]
| |
| | |
| = 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]
| |
| * [https://en.wikipedia.org/wiki/Burnside%27s_lemma Burnside's lemma]
| |
| **[https://en.wikipedia.org/wiki/Group_action group action] and [https://en.wikipedia.org/wiki/Group_action#Orbits_and_stabilizers orbits]
| |
| * [https://en.wikipedia.org/wiki/Permutation#Cycle_notation Cycle decomposition] of permutation
| |
| * [https://en.wikipedia.org/wiki/Pólya_enumeration_theorem Pólya enumeration theorem]
| |
| * [http://en.wikipedia.org/wiki/Inclusion-exclusion_principle The principle of inclusion-exclusion] (and more generally the [http://en.wikipedia.org/wiki/Sieve_theory sieve method])
| |
| * [http://en.wikipedia.org/wiki/M%C3%B6bius_inversion_formula Möbius inversion formula]
| |
| * [http://en.wikipedia.org/wiki/Derangement Derangement], and [http://en.wikipedia.org/wiki/M%C3%A9nage_problem Problème des ménages]
| |
| * [http://en.wikipedia.org/wiki/Ryser%27s_formula#Ryser_formula Ryser's formula]
| |
| * [http://en.wikipedia.org/wiki/Euler_totient Euler totient function]
| |
| * [http://en.wikipedia.org/wiki/Cayley_formula Cayley's formula]
| |
| ** [http://en.wikipedia.org/wiki/Prüfer_sequence Prüfer code for trees]
| |
| ** [http://en.wikipedia.org/wiki/Kirchhoff%27s_matrix_tree_theorem Kirchhoff's matrix-tree theorem]
| |
| * [http://en.wikipedia.org/wiki/Double_counting_(proof_technique) Double counting] and the [http://en.wikipedia.org/wiki/Handshaking_lemma handshaking lemma]
| |
| * [http://en.wikipedia.org/wiki/Sperner's_lemma Sperner's lemma] and [http://en.wikipedia.org/wiki/Brouwer_fixed_point_theorem Brouwer fixed point theorem]
| |
| * [http://en.wikipedia.org/wiki/Pigeonhole_principle Pigeonhole principle]
| |
| :* [http://en.wikipedia.org/wiki/Erd%C5%91s%E2%80%93Szekeres_theorem Erdős–Szekeres theorem]
| |
| :* [http://en.wikipedia.org/wiki/Dirichlet's_approximation_theorem Dirichlet's approximation theorem]
| |
| * [http://en.wikipedia.org/wiki/Probabilistic_method The Probabilistic Method]
| |
| * [http://en.wikipedia.org/wiki/Lov%C3%A1sz_local_lemma Lovász local lemma]
| |
| * [http://en.wikipedia.org/wiki/Erd%C5%91s%E2%80%93R%C3%A9nyi_model Erdős–Rényi model for random graphs]
| |
| * [http://en.wikipedia.org/wiki/Extremal_graph_theory Extremal graph theory]
| |
| * [http://en.wikipedia.org/wiki/Turan_theorem Turán's theorem], [http://en.wikipedia.org/wiki/Tur%C3%A1n_graph Turán graph]
| |
| * Two analytic inequalities:
| |
| :*[http://en.wikipedia.org/wiki/Cauchy%E2%80%93Schwarz_inequality Cauchy–Schwarz inequality]
| |
| :* the [http://en.wikipedia.org/wiki/Inequality_of_arithmetic_and_geometric_means inequality of arithmetic and geometric means]
| |
| * [http://en.wikipedia.org/wiki/Erd%C5%91s%E2%80%93Stone_theorem Erdős–Stone theorem] (fundamental theorem of extremal graph theory)
| |
| * [https://en.wikipedia.org/wiki/Sunflower_(mathematics) Sunflower lemma and conjecture]
| |
| * [http://en.wikipedia.org/wiki/Erd%C5%91s%E2%80%93Ko%E2%80%93Rado_theorem Erdős–Ko–Rado theorem]
| |
| * [http://en.wikipedia.org/wiki/Sperner_family Sperner system]
| |
| * [https://en.wikipedia.org/wiki/Sauer–Shelah_lemma Sauer's lemma] and [https://en.wikipedia.org/wiki/VC_dimension VC dimension]
| |
| * [https://en.wikipedia.org/wiki/Kruskal–Katona_theorem Kruskal–Katona theorem]
| |
| * [http://en.wikipedia.org/wiki/Ramsey_theory Ramsey theory]
| |
| :*[http://en.wikipedia.org/wiki/Ramsey's_theorem Ramsey's theorem]
| |
| :*[http://en.wikipedia.org/wiki/Happy_Ending_problem Happy Ending problem]
| |
| * [https://en.wikipedia.org/wiki/Hall%27s_marriage_theorem Hall's theorem ] (the marriage theorem)
| |
| :* [https://en.wikipedia.org/wiki/Doubly_stochastic_matrix Birkhoff–Von Neumann theorem]
| |
| * [http://en.wikipedia.org/wiki/K%C3%B6nig's_theorem_(graph_theory) König-Egerváry theorem]
| |
| * [http://en.wikipedia.org/wiki/Dilworth's_theorem Dilworth's theorem]
| |
| :* [http://en.wikipedia.org/wiki/Erd%C5%91s%E2%80%93Szekeres_theorem Erdős–Szekeres theorem]
| |
| * The [http://en.wikipedia.org/wiki/Max-flow_min-cut_theorem Max-Flow Min-Cut Theorem]
| |
| :* [https://en.wikipedia.org/wiki/Menger%27s_theorem Menger's theorem]
| |
| :* [http://en.wikipedia.org/wiki/Maximum_flow_problem Maximum flow]
| |