The DOI matches its Crossref record.
The dimension of almost spherical sections of convex bodies
Open accessAbstract
The well-known theorem of Dvoretzky [1] states that convex bodies of high dimension have low dimensional sections which are almost spherical. More precisely, the theorem states that for every integer k and every e> 0 there is an integer n(k, e) such that any Banach space X with dimension> n(k, e) has a subspace Y of dimension k with d{Y,l\\) < 1 + e. Here d(Y, l£) denotes the Banach Mazur distance coefficient between Y and the k dimensional Hubert space l\\ i.e. inflim \\\\T ~ X \\ \\ taken over all operators T from Y onto l\\. The estimate for n(k, e) given in [1] was improved in [5] to n(k, e) = ec(e)k In other words (considering the dependence of n(k, e) on k for fixed e) the dimension of the almost spherical section (of the unit ball) given by Dvoretzky's theorem is about the log of the dimension of the space. This estimate is in general the best possible, since as observed in [10] it is easy to verify that if X = Z ~ any subspace Y of X whose Banach Mazur distance from a Hubert space is < 2 say, must be of dimension at most C log n. It turns out however that if
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cited by
Donoho, D. L. (2006) · IEEE Transactions on Information Theory · doi:10.1109/tit.2006.871582 · Cited by 23,994
(1999) · Cited by 3,186
Donoho, D. L. (2006) · Communications on Pure and Applied Mathematics · doi:10.1002/cpa.20132 · Cited by 2,490
Extensions of compressed sensing
Tsaig, Y., & Donoho, D. L. (2006) · Signal Processing · doi:10.1016/j.sigpro.2005.05.029 · Cited by 947
O'Donnell, R. (2014) · Cambridge University Press eBooks · doi:10.1017/cbo9781139814782 · Cited by 932
Gromov, M. (1983) · Journal of Differential Geometry · doi:10.4310/jdg/1214509283 · Cited by 867
Osserman, R. (1978) · Bulletin of the American Mathematical Society · doi:10.1090/s0002-9904-1978-14553-4 · Cited by 864
LOCI: fast outlier detection using the local correlation integral
Papadimitriou, S., Kitagawa, H., Gibbons, P. B., & Faloutsos, C. (2004) · Proceedings 19th International Conference on Data Engineering (Cat. No.03CH37405) · doi:10.1109/icde.2003.1260802 · Cited by 846
Concentration Inequalities and Model Selection
(2007) · Lecture Notes in Mathematics · doi:10.1007/978-3-540-48503-2 · Cited by 744
Stable distributions, pseudorandom generators, embeddings, and data stream computation
Indyk, P. (2006) · Journal of the ACM · doi:10.1145/1147954.1147955 · Cited by 402
Isoperimetry and Gaussian analysis
Ledoux, M. (1996) · Lecture Notes in Mathematics · doi:10.1007/bfb0095676 · Cited by 328
New volume ratio properties for convex symmetric bodies in ? n
Bourgain, J., & Milman, V. D. (1987) · Inventiones Mathematicae · doi:10.1007/bf01388911 · Cited by 307
Self-citationDense Error Correction Via $\ell^1$-Minimization
Wright, J., & Ma, Y. (2010) · IEEE Transactions on Information Theory · doi:10.1109/tit.2010.2048473 · Cited by 305
Efficient search for approximate nearest neighbor in high dimensional spaces
Kushilevitz, E., Ostrovsky, R., & Rabani, Y. (1998) · Proceedings of the thirtieth annual ACM symposium on Theory of computing - STOC '98 · doi:10.1145/276698.276877 · Cited by 259
Algorithmic applications of low-distortion geometric embeddings
Indyk, P. (2001) · Proceedings 42nd IEEE Symposium on Foundations of Computer Science · doi:10.1109/sfcs.2001.959878 · Cited by 253
Metadata
- Authors
- Figiel, T., Lindenstrauss, J., & Milman, V. D.
- Venue
- Acta Mathematica
- Publisher
- International Press of Boston
- Published
- 1977
- Volume
- 139
- Issue
- 0
- Pages
- 53-94
- ISSN
- 0001-5962 (ISSN-L)
- OpenAlex
- W2028293361
- Cited by
- 401
- References
- 0
- FWCI
- 7.83
- Type
- journal article
- Language
- en
- Open access
- bronze
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.