Back to Search
Start Over
Minkowski complexes and convex threshold dimension.
- Source :
-
Journal of Combinatorial Theory - Series A . Oct2017, Vol. 151, p202-206. 5p. - Publication Year :
- 2017
-
Abstract
- For a collection of convex bodies P 1 , … , P n ⊂ R d 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. [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISSN :
- 00973165
- Volume :
- 151
- Database :
- Academic Search Index
- Journal :
- Journal of Combinatorial Theory - Series A
- Publication Type :
- Academic Journal
- Accession number :
- 123681034
- Full Text :
- https://doi.org/10.1016/j.jcta.2017.04.010