Speaker: Alicia Dickenstein (Buenos Aires)

Title: The structure of smooth lattice polytopes with high codegree
Abstract: A lattice polytope P in R^n is the convex hull of a finite set of integer points. The codegree c of P is the smallest positive integer c such that the dilated polytope cP has an interior integer point. We say that P has high codegree if c > n/2 + 1. Following joint work with Sandra di Rocco, Benjamin Nill and Ragni Piene, we will show the Cayley structure of smooth lattice polytopes with high codegree using tools form combinatorics as well from projective algebraic geometry.