We study a combinatorial notion where given a set S of lattice points one takes the set of all sums of p distinct points in S, and we ask the question: ‘if S is the set of lattice points of a convex lattice polytope, is the resulting set also the set of lattice points of a convex lattice polytope?’ We obtain a positive result in dimension 2 and a negative result in higher dimensions. We apply this to the corner cut polyhedron.
Artur Andrzejak, Emo Welzl. Halving point sets. Documenta Mathematica, Extra Volume, Proceedings of the International Congress of Mathematicians III, pp. 471-478, 1998.
Eric Babson, Shmuel Onn, Rekha Thomas. The Hilbert Zonotope and a Polynomial Time Algorithm for Universal Gröbner Bases. Advances in applied mathematics, 30:529-544, 2003.
Wouter Castryck, Filip Cools, Jeroen Demeyer, Alexander Lemmens. Computing graded Betti tables of toric surfaces. Transactions of the AMS, 372:6869-6903, 2019.
Sylvie Corteel, Gaël Rémond, Gilles Schaeffer, Hugh Thomas. The number of plane corner cuts. Advances in Applied Mathematics, 23:49-53,1999.
Herbert Edelsbrunner, Pavel Valtr, and Emo Welzl. Cutting dense point sets in half. Discrete and Computational Geometry, 17:243—255, 1997.
Irene Müller. Corner cuts and their polytopes, Beiträge zur Algebra und Geometrie, 44:323333, 2003.
Alexander Lemmens. On syzygies of Segre embeddings of 1 x 1. Communications in Algebra, 49:1235-1254, 2021.
Shmuel Onn, Bernd Sturmfels. Cutting corners. Advances in Applied Mathematics, 23:2948, 1999.