Abstract
Given a partition of distinct d-dimensional vectors into p parts, the partition sum of the partition is the sum of vectors in each part. The shape of the partition is a p-tuple of the size of each part. A single-shape partition polytope is the convex hull of partition sums of all partitions that have a prescribed shape. A partition is separable if the convex hull of its parts are pairwise disjoint. The separability of a partition is a necessary condition for the associated partition sum to be a vertex of the single-shape partition polytope. It is also a sufficient condition for d=1 or p=2. However, the sufficiency fails to hold for d≥3 and p≥3. In this paper, we give some geometric sufficient conditions as well as some necessary conditions of vertices in general d and p. Thus, the open case for d=2 and p≥3 is resolved.
Similar content being viewed by others
References
Barnes ER, Hoffman AJ, Rothblum UG (1992) On optimal partitions having disjoint convex and conic hulls. Math Program 54:69–86
Hwang FK, Rothblum UG (2010) Partitions: optimality and clustering. World Scientific, Singapore
Author information
Authors and Affiliations
Corresponding author
Additional information
Supported in part by the National Science Council Taiwan under grant 97-2115-M-030-003.
Rights and permissions
About this article
Cite this article
Liu, YC., Pan, JJ. On the vertex characterization of single-shape partition polytopes. J Comb Optim 22, 563–571 (2011). https://doi.org/10.1007/s10878-010-9305-y
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10878-010-9305-y