Combinatorial slicing problems of polytopes: How (not) to reconstruct a polytope from its slices

Source abstract

We study combinatorial aspects of hyperplane sections of polytopes, focusing on how much the combinatorics of the sections determines the combinatorics of the original polytope. We show that, in general, combinatorial information about the sections is not enough to determine even the $f$-vector of the polytope. In contrast, for sufficiently generic simple polytopes, the function recording the number of vertices of each central section determines the full combinatorial type. We organize different combinatorial slicing properties into hierarchies, separately for affine and central sections, according to the level of combinatorial structure they determine on the polytope. In analogy with classical metric slicing problems, we formulate combinatorial analogues of the Busemann-Petty problem and Bourgain's slicing problem by replacing volume with face numbers, and show that they fail in every dimension and every face dimension.