A note on lower bounds for colourful simplicial depth

DOI10.3390/sym5010047zbMath1351.52004OpenAlexW2025239200MaRDI QIDQ350647

Antoine Deza, Feng Xie, Tamon Stephen

Publication date: 9 December 2016

Published in: Symmetry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3390/sym5010047

zbMATH Keywords

polyhedradiscrete geometrycolourful Carathéodory theoremcolourful simplicial depthcombinatorial symmetry

Mathematics Subject Classification ID

Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Hypergraphs (05C65) Extremal set theory (05D05) Coloring of graphs and hypergraphs (05C15) Helly-type theorems and geometric transversal theory (52A35)

Cites Work

• A simpler proof of the Boros-Füredi-Bárány-Pach-Gromov theorem
• A new lower bound based on Gromov's method of selecting heavily covered points
• More colourful simplices
• Singularities, expanders and topology of maps. II: From combinatorics to topology via algebraic isoperimetry
• On Gromov's method of selecting heavily covered points
• On a notion of data depth based on random simplices
• The colourful feasibility problem
• A quadratic lower bound for colourful simplicial depth
• A generalization of Caratheodory's theorem
• The union of colorful simplices spanned by a colored point set
• Colourful simplicial depth
• Colourful Linear Programming and its Relatives
• A Combinatorial Approach to Colourful Simplicial Depth
• Quadratically Many Colorful Simplices