Slicing the cube in $\textbf {R}^{n}$ and probability (bounds for the measure of a central cube slice in $\textbf {R}^{n}$ by probability methods)
HTML articles powered by AMS MathViewer
- by Douglas Hensley PDF
- Proc. Amer. Math. Soc. 73 (1979), 95-100 Request permission
Abstract:
A cube of dimension n and side 1 is cut by a hyperplane of dimension $n - 1$ through its center. The usual $n - 1$ measure of the intersection is bounded between 1 and M, independent of n. The proof uses an inequality for sums of independent random variables.References
- Z. W. Birnbaum, On random variables with comparable peakedness, Ann. Math. Statistics 19 (1948), 76–81. MR 24099, DOI 10.1214/aoms/1177730293
- Leo Breiman, Probability, Addison-Wesley Publishing Co., Reading, Mass.-London-Don Mills, Ont., 1968. MR 0229267
- Walter Rudin, Real and complex analysis, McGraw-Hill Book Co., New York-Toronto, Ont.-London, 1966. MR 0210528
- S. Sherman, A theorem on convex sets with applications, Ann. Math. Statist. 26 (1955), 763–767. MR 74845, DOI 10.1214/aoms/1177728435
Additional Information
- © Copyright 1979 American Mathematical Society
- Journal: Proc. Amer. Math. Soc. 73 (1979), 95-100
- MSC: Primary 60D05; Secondary 52A22
- DOI: https://doi.org/10.1090/S0002-9939-1979-0512066-8
- MathSciNet review: 512066