A quadratic lower bound for colourful simplicial depth

Simple item page
dc.creatorStephen, Tamon
dc.creatorThomas, Hugh
dc.date2005-12-16
dc.date2007-07-23
dc.date.accessioned2026-07-07T08:19:31Z
dc.date.available2026-07-07T08:19:31Z
dc.descriptionWe show that any point in the convex hull of each of (d+1) sets of (d+1) points in R^d is contained in at least floor((d+2)^2/4) simplices with one vertex from each set.
dc.description4 pages, revised style and organization
dc.identifierhttps://arxiv.org/abs/math/0512400
dc.identifierhttp://arxiv.org/abs/math/0512400
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/134786
dc.subjectCombinatorics
dc.subject52C45, 52A35
dc.titleA quadratic lower bound for colourful simplicial depth
dc.typetext

Files

Collections

arXiv