Random Translates in Minkowski Sums
Paul Balister, Bela Bollobas, Imre Leader, Marius Tiba

TL;DR
This paper investigates how to choose sets in Euclidean space and the torus to minimize the expected volume of their sumsets when adding random points, showing that balls and bands are optimal choices.
Contribution
It proves that Euclidean balls minimize the expected sumset volume in Euclidean space, and bands are optimal in the torus, with stability results included.
Findings
Balls minimize expected sumset volume in Euclidean space.
Bands are optimal in the torus setting.
Stability versions of the optimality results are provided.
Abstract
Suppose that and are sets in , and we form the sumset of with random points of . Given the volumes of and , how should we choose them to minimize the expected volume of this sumset? Our aim in this paper is to show that we should take and to be Euclidean balls. We also consider the analogous question in the torus , and we show that in this case the optimal choices of and are bands, in other words, sets of the form . We also give stability versions of our results.
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 · Computational Geometry and Mesh Generation · Mathematical Approximation and Integration
