Wednesday, June 19, 18:30, room 306

Grigory Yurgin: Complete classification of n-dimentional lattice polytopes of degree 1
Let P be an n-dimensional lattice polytope. Recall that P has degree 1 iff it is not a standard simplex and kP has no interior lattice points for k = 1, 2, …, n-1. In this talk we shell obtain the complete classification of n-dimensional polytopes of degree 1. We are going to use combinatorial methods only.