A quadratic lower bound for colourful simplicial depth

DOI10.1007/s10878-008-9149-xzbMath1201.52013arXivmath/0512400OpenAlexW2049678150MaRDI QIDQ1016046

Hugh Thomas, Tamon Stephen

Publication date: 4 May 2009

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/0512400

zbMATH Keywords

simplicial depthcomputational geometrycolourful Carathéodory theoremcolourful simplicial depthCarathéodory theorem

Mathematics Subject Classification ID

Computational aspects related to convexity (52B55) Combinatorial optimization (90C27)

Related Items

A note on lower bounds for colourful simplicial depth, More colourful simplices, The colourful simplicial depth conjecture, The colourful feasibility problem, Notes about the Carathéodory number

Cites Work

• Unnamed Item
• The colourful feasibility problem
• A generalization of Caratheodory's theorem
• Colourful simplicial depth
• Colourful Linear Programming and its Relatives
• Quadratically Many Colorful Simplices