Math 566: Combinatorial Theory
Syllabus
The syllabus can be found here.
Important Dates
- Last day to add/drop without “W”:
- Midterm: (in class)
- Final Exam due: at 6pm
Office Hours
- Tuesday’s 10:30am–11:30am (EH 3827)
- Thursday’s 10:30am–11:30am (EH 3827)
- Friday’s 2pm–3pm (EH 3827)
Textbook
The optional textbook is Algebraic Combinatorics by Richard P. Stanley, Springer, 2018. UM students can access the ebook here.
References
- [AC] Algebraic Combinatorics by Richard P. Stanley, Springer, 2018. UM access.
- [ArSt] Tilings by Federico Ardila and Richard P. Stanley, 2005. Link.
- [Ma] Thirty-three Miniatures: Mathematical and Algorithmic Applications of Linear Algebra by Jiří Matoušek, 2010. Link.
- [Wi] Generatingfunctionology by Herbert Wilf, Academic Press, 1990. UM access.
Homework Assignments
- Homework 1 due . Hints.
- Homework 2 due . Hints. Selected solutions (Canvas).
- Homework 3 due . Hints.
- Homework 4 due .
- Homework 5 due .
Notes
- Introduction to graph eigenvalues
- Properties of graph eigenvalues
- Walks in cubes and the Radon transform
- Random walks in graphs and hitting times
- Generating functions
- Stationary distributions of random walks in graphs
- Tilings
- Tilings of rectangular grid
- Posets
- Groups and group actions
- Group actions on Boolean algebras
- Partitions and q-binomial coefficients
- The Sperner porperty for L(m,n)
- Spanning trees and resistor networks
- Laplacian and the Matrix-Tree Theorem
- Spanning trees of regular graphs
- Directed Matrix-Tree Theorem and Eulerian tours
- Permutations, statistics, and pattern avoidance
- Standard Young tableaux
- Parking functions and tree inversions
- Gessel-Viennot method and plane partitions
- Some symmetric polynomials
List of Lectures
Date | Topics | Additional Reading | Class Notes | Additional Materials |
---|---|---|---|---|
Graph eigenvalues | [AC, Ch 1] | 1st half of 1 | Handout | |
Graph eigenvalues and properties | [AC, Ch 1] | 2nd half of 1 + most of 2 | Handout | |
Walks in a cube | [AC, Ch 2] | Rest of 2 + 1st page of 3 | Handout | |
Walks in a cube, continued + random walks | [AC, Ch 2] | Rest of 3 | Handout + Notes on matrix associated to a linear transformation | |
Random walks continued | [AC, Ch 3] | Most of 4 | Handout | |
Random walks + generating functions + stationary distributions | [AC, Ch 3 + Exercise 3.1] [Wi, Ch1] | Rest of 4 + 5 + 6 | ||
Tilings | [ArSt 1--2], [Ma, Ch 22] | First 3 pages of 7 | Handout | |
Tilings continued | Rest of 7 | Handout | ||
Tilings of a rectangle + posets | [AC, Ch 4] | 8 + first 2 pages of 9 | Handout | |
Posets and Sperner’s theorem | [AC, Ch 4] | pp 2--4 of 9 | ||
Sperner’s theorem + group actions | [AC, Ch 4+5] | Rest of 9 + 10 | Handout | |
Group actions on Boolean algebras | [AC, Ch 5] | First 2 pages on 11 | Handout | |
Group actions on Boolean algebra continued | [AC, Ch 5] | Worksheet + Last page of 11 | Worksheet | |
Midterm | ||||
Partitions and q-binomial coefficients | [AC, Ch 6] | 12 | Handout | |
Break | ||||
Break | ||||
Sperner property of L(m,n) + spanning trees | [AC, Ch 6] | 13 + First 2 pages of 14 | Handout | |
Resistor networks | pp 2--5 of 14 | |||
Resistor networks + incidence matrix | [AC, Ch 9] | pp 5--7 of 14, first 2 pages of 15 | Handout | |
Laplacian + the Matrix-Tree theorem | [AC, Ch 9] | 15 up to proof of MTT | Handout | |
Spanning trees of regular graphs, directed MTT, and Eulerian tours | [AC, Ch 10] | Rest of 15 + 16 + pp 1--2 of 17 | ||
Proof of BEST Theorem + Applications | [AC, Ch 10] | pp 2--5 of 17 | Worksheet | |
Permutations, statistics, and pattern avoidance | 18 | Handout | ||
Chains in Young’s poset and standard Young tableaux | [AC, Ch 8] | Worksheet | ||
Standard Young tableaux | [AC, Ch 8] | 19 | ||
Standard Young tableaux and RSK | [AC, Ch 8] | 19 | ||
Parking functions and labeled tree inversions | 20 | |||
Gessel-Viennot method and plane partitions | [AC, Ch 8] | 21 | Handout | |
Some symmetric polynomials | 22 |
Date published: Monday, January 2, 2023