5n Minkowski symmetrizations suffice to arrive at an approximate Euclidean ball

DOI10.2307/3597288zbMATH Open1028.52002arXivmath/0204212OpenAlexW2049969034MaRDI QIDQ1860985FDOQ1860985

Authors: B. Klartag 

Publication date: 26 January 2004

Published in: Annals of Mathematics. Second Series (Search for Journal in Brave)

Abstract: This paper proves that for every convex body in R^n there exist 5n-4 Minkowski symmetrizations, which transform the body into an approximate Euclidean ball. This result complements the sharp c n log n upper estimate by J. Bourgain, J. Lindenstrauss and V.D. Milman, of the number of random Minkowski symmetrizations sufficient for approaching an approximate Euclidean ball.

Full work available at URL: https://arxiv.org/abs/math/0204212

Recommendations

• scientific article; zbMATH DE number 1574601
• How small can the intersection of a few rotations of a symmetric convex body be?
• Approximating a convex body by a polytope using the epsilon-net theorem
• Low \(M^*\)-estimates on coordinate subspaces
• Random spheres in a convex body
• Pairs of non-intersecting random flats
• A note on Sylvester’s four-point problem
• scientific article; zbMATH DE number 177383
• Geometry of random sections of isotropic convex bodies

zbMATH Keywords

convex bodyrandomnessMinkowski symmetrizations

Mathematics Subject Classification ID

Convex sets in (n) dimensions (including convex hypersurfaces) (52A20) Approximation by convex sets (52A27)

Cited In (12)

• Generalization of Klain’s theorem to Minkowski symmetrization of compact sets and related topics
• Minkowski symmetrization and projection bodies
• Robust one-bit compressed sensing with partial circulant matrices
• Convergence of symmetrization processes
• Isomorphic Steiner symmetrization of \(p\)-convex sets
• Symmetrizations
• Title not available (Why is that?)
• Some new positions of maximal volume of convex bodies
• Title not available (Why is that?)
• Title not available (Why is that?)
• On the optimality of the empirical risk minimization procedure for the convex aggregation problem
• Improved bounds for sparse recovery from subsampled random convolutions

This page was built for publication: \(5n\) Minkowski symmetrizations suffice to arrive at an approximate Euclidean ball

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1860985)