Math 3012: Applied Combinatorics

Summer 2015 at Georgia Institute of Technology
Syllabus

 
Instructor:
Shane Scott
 
Email:
 
Office:
Skiles 252
 
Hours:
MF 11-12, W 4-5, or by appointment

Resources

The Course


 

Date

Topic

Text

Links

Slides

 

 
30 July
Final Exam 11:30-2:20

 
 
Review

 
17 July
Probability
10.1-2
Monty Hall
Day 26
 

 
15 July
Flow Applications
14.2
Bipartite Matching
Day 25
 

 
13 July
Flow Complexity
13.4
Edmunds-Karp
Day 24
 

 
Homework: Suggested excercises: § 13.7 #1,5,9,10 § 14.4 # 2

 
10 July
Network Flows
13.1-3
Ford Fulkerson
Day 23
 

 
Homework: Read § 13.4-5

 
8 July
More Graph Algoritms
Addendum
Postman Problem
Day 22
 

 
Homework: Read § 13.1-3

 
6 July
Weighted Graphs
12
Kruskal's Prim's Dijkstra's
Day 21
 

 
Homework 8: Read § 12. Excercises § 15.6 # 4,12, § 12.6 #2,3,11. Due 13 July.

 
1 July
Exam 2: § 6.1-3, 7, 8, 9

 
29 June
Polya's Enumeration
15
Polya in Sage
Day 20
 

 
26 June
Burnside's Lemma
15.1-3
Burnside Tic Tac Toe
Day 19
 

 
24 June
Recurrence Relations
9
Nonhomogenous Recurrence
Day 18
 

 
Homework 7: Excercises § 9.2,4,10,12. Due 1 July.

 
22 June
Recurrence Relations
9
Solving Recurrences
Day 17
 

 
Homework: Read § 9.1-3

 
19 June
Generating Functions II
8
Fibonacci
Day 16
 

 
Homework 6: Read 8.4-5. Excercises § 6.10 # 4, § 7.7 #2,15,21, § 8.8 # 2d-f,6,15. Due 26 June. Use a computer algebra system for the difficult polynomial arithmetic (8.8 # 6,15) Here is an example in Sage Math Cloud.

 
17 June
Generating Functions
8.1-3
Generating Functions
Day 15
 

 
Homework: Read § 8

 
15 June
Twelvefold Way
7.4
12fold
 Day 14
 

 
Homework: Read § 7.4.

 
12 June
Inclusion-Exclusion
7.1-3
 
 Day 13
 

 
Homework: Read § 7.1-3.

 
10 June
Exam 1: § 2,3,4,5

 
8 June
Trees vs Posets
6.1-3
Binary Relations
 Day 12
 

 
5 June
Planarity
5.5
Planarity Game Planarity
Day 11
 

 
Homework: Read § 6.1-3. Excercises § 5.9 # 6,11,15,17,29,34. Due 12 June.

 
3 June
Coloring
5.4-5
Hamiltonian
Day 10
 

 
Homework: Read § 5.6-8

 
1 June
Graphs
5.1-3
Eulerian Game Isomorphic
Day 9
 

 
Homework: Read § 5.4-5.

 
29 May
Complexity
4.2-5
P vs NP
Day 8
 

 

Homework 4: Read § 5.1-3. Excercises § 4.6 # 1.a,b,g,m

Problem 6: Ten points are chosen inside a square with sidelength 1. Prove that it is always possible to find a pair of points that are at most √2/3 apart.

Problem 7: The Enigma Machine (watch) was used during WWII to encrypt messages character by character. Decrypting a message requires using the same machine setting as the encryption. Determine the complexity of decrypting an Enigma encoded message by trying every possible setting in terms of the input alphabet size n=2k. (For English letters n=26, k=13). The setting cosists of 1) a choice of 1st, 2nd, and 3rd rotor from 5 rotors, each of which has n rotary starting positions corresponding to the letters and 2) a 'plug setting' which swaps every letter with exactly one partner. Due 5 June.


 
27 May
Pigeonhole Principle
4.1
PHP
Day 7
 

 
Homework: Read § 4.4-5.

 
22 May
Induction
3
Proof by Induction
Day 6
 

 
Homework 3: Read § 4.1-3. Excercises: § 3.11 #1,3,4,19,20. Due 29 May.

 
20 May
Counting Repetitions and Symmetry
2.6-8
 
Day 5
 

 
Homework: Read § 3.1,2,5,6

 
18 May
Binomial Coefficients
2.4-5
Combinations
Day 4
 

 
Homework: Read § 2.7-8

 
15 May
Bijections, Strings, Permute
A.4, 2.1-3
Permutations
Day 3
 

 
Homework 2: Read § 2.4-6 for Monday. T-square appendix quiz. Excercises: § 2.9 #2,3,13,19,31. Due 22 May.

 
13 May
Sets and Functions
A.1-A.6
Functions
Day 2
 

 
Homework: Read Appendix sections § A.4-5 and § 2.1-3.

 
11 May
What is Combinatorics?
1
Stable Marriage
Day 1
 

 
Homework 1: (6 points) Introduce yourself on Piazza. Read Appendix sections § A.1-6.

Additional Interest and Help

Math Lab Tutoring
Numberphile: My favorite math videos
The Infinite Monkey Cage: An episode on numbers from a great science podcast.
Sage: Python based math programming. Try Sage Cloud