Travis Dillon (MIT, USA): Explicit bounds for the layer number of the grid

Abstract: To peel a finite point set in Euclidean space, remove the
vertices of its convex hull. The number of times a point set must be
peeled to remove all of its vertices is called the layer number of the
set. Though the layer number of many natural point sets has been
determined, the layer number of the grid $\{1, 2, \dots, n\}^d$ remains
unknown. The central results of this talk are two short proofs that
significantly improve the bounds for the layer number of grids. We show
as a consequence that the layer number of grids is linear in $d$.