Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
5777489 | Journal of Combinatorial Theory, Series A | 2017 | 5 Pages |
Abstract
For a collection of convex bodies P1,â¦,PnâRd containing the origin, a Minkowski complex is given by those subsets whose Minkowski sum does not contain a fixed basepoint. Every simplicial complex can be realized as a Minkowski complex and for convex bodies on the real line, this recovers the class of threshold complexes. The purpose of this note is the study of the convex threshold dimension of a complex, that is, the smallest dimension in which it can be realized as a Minkowski complex. In particular, we show that the convex threshold dimension can be arbitrarily large. This is related to work of Chvátal and Hammer (1977) regarding forbidden subgraphs of threshold graphs. We also show that convexity is crucial this context.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Florian Frick, Raman Sanyal,