On the Number of Vertices in a Hyperplane Section of a Polytope

We study the slices or sections of a convex polytope by affine hyperplanes. We present results on two key problems: First, we provide tight bounds on the maximum number of vertices attainable by a hyperplane slice of $d$-polytope (a sort of upper bound theorem) and discuss a new algorithm to find all sections. Second, we investigate the sequence of numbers of vertices produced by the different slices over all possible hyperplanes and analyze the gaps that arise in that sequence. We study these sequences for three-dimensional polytopes and for hypercubes. Our results were obtained with the help of large computational experiments, and we report on new data generated for hypercubes.