A quadratic lower bound for colourful simplicial depth
classification
🧮 math.CO
keywords
boundcolourfulcontainedconvexdepthfloorhullleast
read the original abstract
We show that any point in the convex hull of each of (d+1) sets of (d+1) points in R^d is contained in at least floor((d+2)^2/4) simplices with one vertex from each set.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.