arXivDaily arXiv每日学术速递 周一至周五更新
arXiv math/0609569math.DGmath.MG
收藏

The width-volume inequality

Larry Guth

英文摘要:

We prove that a bounded open set U in Euclidean n-space has k-width less than C(n) Volume(U)^{k/n}. Using this estimate, we give lower bounds for the k-dilation of degree 1 maps between certain domains in Euclidean space. In particular, we estimate the smallest (n-1)-dilation of any degree 1 map between two n-dimensional rectangles. For any pair of rectangles, our estimate is accurate up to a dimensional constant C(n). We give examples in which the (n-1)-dilation of the linear map is bigger than the optimal value by an arbitrarily large factor.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑