Combinatorial Theory: Hyperplane Arrangements
A graduate-level topics course from MIT OpenCourseWare covering hyperplane arrangements, with the background needed from poset theory and matroid theory to support the main material. The course content shifts from year to year based on instructor and student interest, but centers on the combinatorics of arrangements: how a collection of hyperplanes divides space into regions, and how tools like the intersection lattice, characteristic polynomial, and broken circuit complexes let you count and classify those regions. Materials include lecture notes and problem sets published through MIT OpenCourseWare, free to access with no enrollment or certificate. Suited to students who already have a solid grounding in combinatorics and linear algebra, since the course builds directly on that foundation rather than reintroducing it.