Another low-technology estimate in convex geometry
classification
🧮 math.MG
keywords
admitsanotherargumentballbanachconvexdimensionestimate
read the original abstract
We give a short argument that for some C > 0, every n-dimensional Banach ball K admits a 256-round subquotient of dimension at least C n/(log n). This is a weak version of Milman's quotient of subspace theorem, which lacks the logarithmic factor.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.