Convexity of distinct sum sets
From MaRDI portal
Publication:6311546
DOI10.1556/012.2022.01516zbMATH Open1513.52014arXiv1812.09527MaRDI QIDQ6311546FDOQ6311546
Authors: Alexander Lemmens 
Publication date: 22 December 2018
Abstract: We study a combinatorial notion where given a set of lattice points one takes the set of all sums of subsets of a fixed size, and we ask if the given set comes from a convex lattice polytope whether the resulting set also comes from 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.
Lattice polytopes in convex geometry (including relations with commutative algebra and algebraic geometry) (52B20) Group actions on combinatorial structures (05E18) Lattices and convex bodies in (2) dimensions (aspects of discrete geometry) (52C05)
This page was built for publication: Convexity of distinct sum sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6311546)
