Lower Bounds for Colourful Simplicial DepthAlgebra & Discrete Mathematics
|Speaker:||Tamon Stephen, Dept. of Mathematics, Simon Fraser University|
|Start time:||Thu, Feb 7 2013, 3:10PM|
The simplicial depth of a point p in R^d with respect to a finite set S of points is the number of (d+1)-sets from S whose convex hull contains p. A natural generalization is to colour the points of S and consider only the colourful simplices containing p. We exhibit a configuration where p is in the convex hull of each of (d+1) colours, but is only in d^2+1 colourful simplices. We conjecture that this is minimal and investigate lower bounds. This result can be viewed as a refinement of Barany's Colourful Caratheodory Theorem.
This talk was scheduled in place of Andrew Critch's talk which was canceled.