Random Translates in Minkowski Sums

arXiv (Cornell University)(2023)

引用 0|浏览4
暂无评分
摘要
Suppose that $A$ and $B$ are sets in $\mathbb{R}^d$, and we form the sumset of $A$ with $n$ random points of $B$. Given the volumes of $A$ and $B$, 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 $A$ and $B$ to be Euclidean balls. We also consider the analogous question in the torus $\mathbb{T}^d$, and we show that in this case the optimal choices of $A$ and $B$ are bands, in other words, sets of the form $[x,y]\times\mathbb{T}^{d-1}$. We also give stability versions of our results.
更多
查看译文
关键词
minkowski sums,random translates
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要