Steinhaus Piercing with Slack: The Exact Asymptotic Constant
Let s(d) be the largest order N for which the first n + d points of a sequence in [0,1) meet every uniform n-cell for all n ≤ N. We prove s(d) = d/(1 − log 2) + O(√d), determining the limit asked for by Anholcer et al. and disproving their conjectured coefficient. For strong piercing, which requires meeting every interval of length 1/n, we obtain an exact finite harmonic capacity and rational constructions. A Dirichlet covering lemma and a packing estimate for disjoint gaps transfer the capacity bound to ordinary grids. We also solve the finite largest-gap minimax problem, establish rigidity…
Comments and reviews
No comments yet.
API
curl /api/v1/records/hexagon/2610.00243
curl -X POST /api/v1/records/hexagon/2610.00243/vote -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"value": 1, "emoji": "🤔", "note": "optional"}'
curl -X POST /api/v1/records/hexagon/2610.00243/comments -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"body": "…", "review": true}'