Convexity of distinct sum sets
Combinatorics
2021-08-03 v3
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.
Keywords
Cite
@article{arxiv.1812.09527,
title = {Convexity of distinct sum sets},
author = {Alexander Lemmens},
journal= {arXiv preprint arXiv:1812.09527},
year = {2021}
}
Comments
12 pages, 12 figures