Geometric Combinatorics
MIT OpenCourseWare's introduction to discrete and computational geometry focuses on combinatorial methods for analyzing arrangements of points, lines, and polytopes. The course covers topics such as convex hulls, triangulations, arrangements of hyperplanes, and combinatorial bounds, drawing on recent research results and including open problems still unsolved in the field. Materials consist of lecture notes and problem sets that walk through proofs and constructions rather than routine computation, aimed at students with a solid background in mathematics. There is no instructor video component; the course is self-study through MIT's published notes. As with all MIT OpenCourseWare offerings, the material is free to access and there is no certificate. It suits anyone wanting a rigorous, research-adjacent grounding in geometric combinatorics rather than a gentle survey.