Mathematics Colloquia and Seminars

Return to Colloquia & Seminar listing

Convex bodies and functions are classical objects that are often used as good approximations of more complicated mathematical objects. Computational convexity is an area of mathematics that deals with  problems and applications involving effectively computing with convex sets. Applications arise everywhere from optimization, statistics to pure combinatorics, algebra and other fields.

In this informal talk I will survey a number of convex geometry problems whose solution have diverse applications. Examples will include looking at the lattice points for problems in integer optimization and the problem of computing volumes and mixed volumes of convex polytopes which has interesting applications in algebraic geometry.