Cube slicing in ⁿ
暂无分享，去创建一个
We prove that every (n 1)-dimensional section of the unit cube in R' has volume at most I2 This upper bound is clearly best possible.
[1] U. Haagerup. The best constants in the Khintchine inequality , 1981 .
[2] J. Vaaler. A geometric inequality with applications to linear forms , 1979 .
[3] D. Hensley,et al. Slicing the cube in ⁿ and probability (bounds for the measure of a central cube slice in ⁿ by probability methods) , 1979 .