A quantitative variant of the multi-colored Motzkin-Rabin theorem
Abstract
We prove a quantitative version of the multi-colored Motzkin-Rabin theorem in the spirit of [BDWY12]: Let V1,…,Vn ⊂ Rd be n disjoint sets of points (of n `colors'). Suppose that for every Vi and every point v ∈ Vi there are at least δ |Vi| other points u ∈ Vi so that the line connecting v and u contains a third point of another color. Then the union of the points in all n sets is contained in a subspace of dimension bounded by a function of n and δ alone.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.