MATH 149 CM - Discrete Geometry

The goal of this course is to introduce students to the basics of discrete and convex geometry. Topics covered will include convex bodies, lattices, quadratic forms, and interactions between them, such as the fundamentals of Minkowski’s theory, shortest vector problem, reduction algorithms, LLL, and connections to computational complexity and theoretical computer science. Additional topics may include an introduction to optimization questions, such as packing, and convering problems.

Prerequisites: MATH 032 CM and MATH 060 CM

Offered: Occasionally

Credit: 1

Course Number: MATH149 CM