A quadratic lower bound for colourful simplicial depth

We show that any point in the convex hull of each of (d+1) sets of (d+1) points in ℝd is contained in at least ⌊(d+2)2/4⌋ simplices with one vertex from each set.

[1]  Imre Bárány,et al.  A generalization of carathéodory's theorem , 1982, Discret. Math..

[2]  Jirí Matousek,et al.  Quadratically Many Colorful Simplices , 2007, SIAM J. Discret. Math..

[3]  Tamon Stephen,et al.  Colourful Simplicial Depth , 2006, Discret. Comput. Geom..

[4]  Tamon Stephen,et al.  The colourful feasibility problem , 2008, Discret. Appl. Math..

[5]  Imre Ba´ra´ny,et al.  Quadratically Many Colorful Simplices , 2007 .

[6]  Imre Bárány,et al.  Colourful Linear Programming and its Relatives , 1997, Math. Oper. Res..

[7]  V. Rosta,et al.  Data Depth and Maximum Feasible Subsystems , 2005 .

[8]  I Barany,et al.  A GENERALIZATION OF CARATHEODORYS THEOREM , 1982 .