Shrinking the Jung radius: Maximizing partial coverage of finite point sets
Abstract
Jung's theorem says that planar sets of diameter 1 can be covered by a closed circular disk of radius 13. In this paper we consider a fractional Jung-type problem for finite planar point-sets. Let Pn be the family of all finite sets of n points in the plane, of diameter at most 1. Let the function value Nn(r) (0 < r ≤ 1) be the largest integer k so that for every point set P ∈ Pn there is a closed circular disk of radius r which covers at least k points of P. We focus on the radii r= 12 and r= 14 and prove exact maximum values. Concerning the radius r= 12, we prove Nn(12)= n3+1. Concerning the radius r= 14, we prove that Nn(14) = n7 if n is not a multiple of 7, and Nn(14) is n7 or n7+1 otherwise. We also initiate further study of the function Nn(r) by giving lower and upper bounds for Nn(r) (0 < r < 13).
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.