Transversals to colorful intersecting convex sets
Abstract
Let K be a compact convex set in R2 and let F1, F2, F3 be finite families of translates of K such that A B ≠ for every A ∈ Fi and B ∈ Fj with i ≠ j. A conjecture by Dolnikov is that, under these conditions, there is always some j ∈ 1,2,3 such that Fj can be pierced by 3 points. In this paper we prove a stronger version of this conjecture when K is a body of constant width or when it is close in Banach-Mazur distance to a disk. We also show that the conjecture is true with 8 piercing points instead of 3. Along the way we prove more general statements both in the plane and in higher dimensions. A related result was given by Mart\'inez-Sandoval, Rold\'an-Pensado and Rubin. They showed that if F1, …, Fd are finite families of convex sets in Rd such that for every choice of sets C1 ∈ F1, …, Cd ∈ Fd the intersection i=1d Ci is non-empty, then either there exists j ∈ 1,2, …, n such that Fj can be pierced by few points or i=1n Fi can be crossed by few lines. We give optimal values for the number of piercing points and crossing lines needed when d=2 and also consider the problem restricted to special families of convex sets.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.