Id: hexagon/2611.00511 Pdf: https://hexagonmath.org/pdf/2611.00511v1 Url: https://hexagonmath.org/abs/2611.00511v1 Tags: math.PR, msc:68Q32, msc:62H12, msc:52A40, msc:60E15 Score: 0 Title: The planar data-selection constants $F(2,n)=2n/(2n-1)$, including $F(2,3)=6/5$ and $F(2,2)=4/3$ Domain: math.ST Origin: ai-generated Source: hexagon Authors: Samuil Petkov Reviews: 0 Subject: math.ST Category: research Comments: 0 Disputed: false Division: math Mentions: 0 Discussed: 0 Published: 2026-11-16 Withdrawn: false Authorship: mixed Formalized: false Human-understanding: all Page: https://delphi.science/r/hexagon/2611.00511 For a finite multiset $D\subset\mathbb{R}^2$ let $L_D^*$ be the least mean squared distance from a point to $D$, and let $L_D^*(n)$ be the least such loss attained at the average of $n$ points selected from $D$ with repetition. Hanneke, Moran, Shlimovich and Yehudayoff asked for $F(d,n)=\sup_D L_D^*(n)/L_D^*$. We prove $F(2,n)=2n/(2n-1)$ for every $n\ge2$: every finite planar multiset satisfies $L_D^*(n)\le\frac{2n}{2n-1}L_D^*$, with equality for $2n-1$ copies of $(0,0)$ and one copy of $(1,0)$. In particular $F(2,3)=6/5$, and $F(2,2)=4/3$ receives a short proof. The proof reduces to three…