A quadratic lower bound for colourful simplicial depth
Combinatorics
2007-07-23 v2
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.
Cite
@article{arxiv.math/0512400,
title = {A quadratic lower bound for colourful simplicial depth},
author = {Tamon Stephen and Hugh Thomas},
journal= {arXiv preprint arXiv:math/0512400},
year = {2007}
}
Comments
4 pages, revised style and organization