Asymptotics of Best-Packing on Rectifiable Sets
S.V. Borodachov, D.P. Hardin, E.B. Saff

TL;DR
This paper studies the asymptotic behavior of optimal point configurations on rectifiable sets, linking best-packing and Riesz energy, and reveals dimension-related properties and subsequence-dependent behaviors.
Contribution
It establishes the asymptotic relationship between best-packing and Riesz energy configurations on rectifiable sets, connecting these to Minkowski dimension and subsequence behaviors.
Findings
Best-packing configurations' asymptotics match Minkowski dimension.
Minimal Riesz s-energy constants have s-th root asymptotics as s→∞.
Different subsequences show varied limiting behaviors for sets with integer Hausdorff dimension.
Abstract
We investigate the asymptotic behavior, as grows, of the largest minimal pairwise distance of points restricted to an arbitrary compact rectifiable set embedded in Euclidean space, and we find the limit distribution of such optimal configurations. For this purpose, we compare best-packing configurations with minimal Riesz -energy configurations and determine the -th root asymptotic behavior (as of the minimal energy constants. We show that the upper and the lower dimension of a set defined through the Riesz energy or best-packing coincides with the upper and lower Minkowski dimension, respectively. For certain sets in of integer Hausdorff dimension, we show that the limiting behavior of the best-packing distance as well as the minimal -energy for large is different for different subsequences of the cardinalities of the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsPoint processes and geometric inequalities · Geometric Analysis and Curvature Flows · Mathematical Dynamics and Fractals
