Abstract
The colorful simplicial depth of a collection of d + 1 finite sets of points in Euclidean d-space is the number of choices of a point from each set such that the origin is contained in their convex hull. We use methods from combinatorial topology to prove a tight upper bound on the colorful simplicial depth. This implies a conjecture of Deza et al. [7]. Furthermore, we introduce colorful Gale transforms as a bridge between colorful configurations and Minkowski sums. Our colorful upper bound then yields a tight upper bound on the number of totally mixed facets of certain Minkowski sums of simplices. This resolves a conjecture of Burton [6] in the theory of normal surfaces.
Originalsprog | Engelsk |
---|---|
Tidsskrift | International Mathematics Research Notices |
Vol/bind | 2019 |
Udgave nummer | 6 |
Sider (fra-til) | 1894-1919 |
ISSN | 1073-7928 |
DOI | |
Status | Udgivet - 22 mar. 2019 |