A Note on Lower Bounds for Colourful Simplicial Depth
The colourful simplicial depth problem in dimension d is to find a configuration of (d+1) sets of (d+1) points such that the origin is contained in the convex hull of each set, or colour, but contained in a minimal number of colourful simplices generated by taking one point from each set. A construc...
Main Authors: | Antoine Deza, Tamon Stephen, Feng Xie |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2013-01-01
|
Series: | Symmetry |
Subjects: | |
Online Access: | http://www.mdpi.com/2073-8994/5/1/47 |
Similar Items
-
Some remarks about Poincaré type inequalities and representation formulas in metric spaces of homogeneous type
by: Wheeden Richard L, et al.
Published: (1999-01-01) -
Convexity and related combinatorial geometry /
by: Kay, David C., et al.
Published: (1982) -
The simpliciality of higher-order networks
by: Nicholas W. Landry, et al.
Published: (2024-03-01) -
Colour Memory Analysis for Selected Associative Colours
by: Marta Stjepić, et al.
Published: (2021-11-01) -
Immunization strategies for simplicial irreversible epidemic on simplicial complex
by: Wenjie Li, et al.
Published: (2022-09-01)