The Discrete Gauss Image Problem

Abstract: The Gauss Image problem is a generalization to the question originally posed by Aleksandrov who studied the existence of the convex body with the prescribed Aleksandrov's integral curvature. A simple discrete case of the Gauss Image Problem can be formulated as follows: given a finite set of directions in Euclidian space and the same number of unit vectors, does there exist a convex polytope in this space containing the origin in its interior with vertices at given directions such that each normal cone at the vertex contains exactly one of the given vectors. In this talk, we are going to discuss the discrete Gauss Image Problem, and its relation to other Minkowski-type problems. Two different proofs of the problem are going to be addressed: A smooth proof based on transportation polytopes and a discrete proof based on Helly’s theorem. Time permitting, we will also discuss the uniqueness statement for the problem.

computational geometrydiscrete mathematicscommutative algebracombinatorics

Audience: researchers in the topic

Copenhagen-Jerusalem Combinatorics Seminar

Series comments: There is a mailing list for talk announcements. If you want to receive the announcements, send an e-mail to the organizer to subscribe to the mailing list.

The password for the zoom room is 123456