Combinatorics (조합론)

Class Info Class Number: MATH 254-001 Dates: Mar 02 2022 - Jun 17 2022 Room: NS 318 Meeting time: Mon 9:00 - 10:20 (1A) Wed 10:30 - 11:50 (2B) Prof: Mark Siggers Office Hours Text: Richard Brualdi's "Introductory Combinatorics (Fifth Edition)"

Links Class Infomation Classnotes

Syllabus

This is an introductory course in combinatorics. We will cover a broad range of basic combintorial topics such as counting, recursion, generating functions and graphs. Our emphasis will be on proof techniques and writing proofs. We will stay pretty close to the following schedule, refering to Brualdi's text "Introductory Combinatorics".

Week	Chapters	Topics
1	1	What is Combinatorics?
2	2	Permutations and Combinations
3	3-4	The Pigeonhole Principle and Generating Permutations
4	5	Binomial Coefficients
5	6-7	Inclusion-Exclusion, Generating Functions
6	7	Recurrence Relations
7	9	Systems of Distinct Representatives
8		Midterm Exam
9	10	Combinatorial Designs
10	11	Graph Theory
11	12	Graph Theory
12	13	Digraphs and Networks
13	14	Burnside's Theorem
14	-	Final Exam

Homework.

There will homework problems each week. You do not have to hand them in, but we will have weekly quizzes based on the homework. They will also appear on tests.

Attendence and participation

Attendence will be monitored with the weekly quizzes. The majority of the marks on the quiz will be for putting your name on the paper.

Tests

There will be two tests. We will decide the date of the exams at least 2 weeks before the exam.

Evaluation

Attendence and participation: 10% Tests: 2 x 45%.