Abstract

The colourful simplicial depth conjecture states that any point in the convex hull of each of $d+1$ sets, or colours, of $d+1$ points in general position in $\mathbb{R}^d$ is contained in at least $d^2+1$ simplices with one vertex from each set. We verify the conjecture in dimension 4 and strengthen the known lower bounds in higher dimensions. These results are obtained using a combinatorial generalization of colourful point configurations called octahedral systems. We present properties of octahedral systems generalizing earlier results on colourful point configurations and exhibit an octahedral system which cannot arise from a colourful point configuration. The number of octahedral systems is also given.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.