A Note on Lower Bounds for Colourful Simplicial Depth

The colourful simplicial depth problem in dimension d is to find a configuration of (d+1) sets of (d+1) points such that the origin is contained in the convex hull of each set, or colour, but contained in a minimal number of colourful simplices generated by taking one point from each set. A construc...

Full description

Bibliographic Details
Main Authors: Antoine Deza, Tamon Stephen, Feng Xie
Format: Article
Language:English
Published: MDPI AG 2013-01-01
Series:Symmetry
Subjects:
Online Access:http://www.mdpi.com/2073-8994/5/1/47

Similar Items