Skip to main content

A Quantitative Variant of the Multi-colored Motzkin–Rabin Theorem

Author(s): Dvir, Zeev; Tessier-Lavigne, Christian

Download
To refer to this page use: http://arks.princeton.edu/ark:/88435/pr11m4j
Full metadata record
DC FieldValueLanguage
dc.contributor.authorDvir, Zeev-
dc.contributor.authorTessier-Lavigne, Christian-
dc.date.accessioned2018-07-20T15:10:58Z-
dc.date.available2018-07-20T15:10:58Z-
dc.date.issued2014-11-19en_US
dc.identifier.citationDvir, Z, Tessier-Lavigne, C. (2015). A Quantitative Variant of the Multi-colored Motzkin–Rabin Theorem. Discrete and Computational Geometry, 53 (38 - 47. doi:10.1007/s00454-014-9647-9en_US
dc.identifier.urihttp://arks.princeton.edu/ark:/88435/pr11m4j-
dc.description.abstractWe prove a quantitative version of the multi-colored Motzkin–Rabin theorem in the spirit of Barak et al. (Proceedings of the National Academy of Sciences, 2012): Let (Formula presented.) be (Formula presented.) disjoint sets of points (of (Formula presented.) ‘colors’). Suppose that for every (Formula presented.) and every point (Formula presented.) there are at least (Formula presented.) other points (Formula presented.) so that the line connecting (Formula presented.) and (Formula presented.) contains a third point of another color. Then the union of the points in all (Formula presented.) sets is contained in a subspace of dimension bounded by a function of (Formula presented.) and (Formula presented.) alone.en_US
dc.format.extent38 - 47en_US
dc.language.isoen_USen_US
dc.relation.ispartofDiscrete and Computational Geometryen_US
dc.rightsAuthor's manuscripten_US
dc.titleA Quantitative Variant of the Multi-colored Motzkin–Rabin Theoremen_US
dc.typeJournal Articleen_US
dc.identifier.doidoi:10.1007/s00454-014-9647-9-
dc.date.eissued2014en_US
pu.type.symplectichttp://www.symplectic.co.uk/publications/atom-terms/1.0/journal-articleen_US

Files in This Item:
File Description SizeFormat 
A Quantitative Variant of the Multi-colored Motzkin–Rabin Theorem.pdf111.22 kBAdobe PDFView/Download


Items in OAR@Princeton are protected by copyright, with all rights reserved, unless otherwise indicated.