Colorful and Quantitative Variations of Krasnosselsky's Theorem
Abstract
Krasnosselsky's art gallery theorem gives a combinatorial characterization of star-shaped sets in Euclidean spaces, similar to Helly's characterization of finite families of convex sets with non-empty intersection. We study colorful and quantitative variations of Krasnosselsky's result. In particular, we are interested in conditions on a set K that guarantee there exists a measurably large set K' such that every point in K' can see every point in K. We prove results guaranteeing the existence of K' with large volume or large diameter.
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.