|Explorations in Discrete Geometry|
|Time：||Tue/Thu 13:00-14:50, 2015-07-14 ~ 2015-07-30|
|Instructor：||Thomas Hales [University of Pittsburgh]|
|Place：||Conference Room 3, Floor 2, Jin Chun Yuan West Building|
This course will survey a number of problems in discrete, combinatorial, and algorithmic geometry in Euclidean space. Topics will include packings of spheres and other convex bodies (such as pentagons and tetrahedra), covering problems, the honeycomb conjecture in the plane and the Kelvin problem in three dimensions, the Reinhardt conjecture, optimal lattices and bounds in large dimensions. Many open research problems will be introduced.
Pach and Agarwal, “Combinatorial Geometry”