English

Shrinking the Jung radius: Maximizing partial coverage of finite point sets

Combinatorics 2025-12-03 v2 Metric Geometry

Abstract

Jung's theorem says that planar sets of diameter 11 can be covered by a closed circular disk of radius 13\frac 1{\sqrt3}. In this paper we consider a fractional Jung-type problem for finite planar point-sets. Let Pn\mathcal{P}_n be the family of all finite sets of nn points in the plane, of diameter at most 11. Let the function value Nn(r)N_n(r) (0<r10 < r \leq 1) be the largest integer kk so that for every point set PPnP \in \mathcal{P}_n there is a closed circular disk of radius rr which covers at least kk points of PP. We focus on the radii r=12r=\frac 12 and r=14r=\frac 14 and prove exact maximum values. Concerning the radius r=12r= \frac 12, we prove Nn(12)=n3+1N_n(\frac{1}{2})=\lceil \frac{n}{3}\rceil+1. Concerning the radius r=14r= \frac 14, we prove that Nn(14)=n7N_{n}(\frac{1}{4}) = \lceil \frac{n}{7}\rceil if nn is not a multiple of 7, and Nn(14)N_{n}(\frac{1}{4}) is n7 \frac{n}{7} or n7+1 \frac{n}{7}+1 otherwise. We also initiate further study of the function Nn(r)N_n(r) by giving lower and upper bounds for Nn(r)N_n(r) (0<r<130 < r < \frac 1{\sqrt3}).

Keywords

Cite

@article{arxiv.2407.03553,
  title  = {Shrinking the Jung radius: Maximizing partial coverage of finite point sets},
  author = {András Bezdek and Owen Henderschedt},
  journal= {arXiv preprint arXiv:2407.03553},
  year   = {2025}
}
R2 v1 2026-06-28T17:28:38.141Z