Explicit bounds for the layer number of the grid

arXiv2302.04244MaRDI QIDQ6425871FDOQ6425871

Authors: Travis Dillon, Narmada Varadarajan 

Publication date: 8 February 2023

Abstract: The number of steps required to exhaust a point set by iteratively removing the vertices of its convex hull is called the layer number of the point set. This article presents a short proof that the layer number of the grid ${1,2,dots,n}^d$ is at most $frac14d{n}^2+1$, significantly improving the dependence on $d$ in the best-known upper bound. We also prove a lower bound of $frac12d(n-1)+1$, which shows that the layer number of the grid is linear in $d$.

This page was built for publication: Explicit bounds for the layer number of the grid

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6425871)