The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
There exists an absolute constant such that for any n-dimensional Banach space E there exists a k-dimensional subspace F ⊂ E with k≤ n/2 such that . The concept of volume ratio with respect to -spaces is used to prove the following distance estimate for : .
Let ε > 0 and 1 ≤ k ≤ n and let be affine subspaces of ℝⁿ, each of dimension at most k. Let if ε < 1, and m = O(k + log p/log(1 + ε)) if ε ≥ 1. We prove that there is a linear map such that for all 1 ≤ l ≤ p and we have ||x-y||₂ ≤ ||H(x)-H(y)||₂ ≤ (1+ε)||x-y||₂, i.e. the distance distortion is at most 1 + ε. The estimate on m is tight in terms of k and p whenever ε < 1, and is tight on ε,k,p whenever ε ≥ 1. We extend these results to embeddings into general normed spaces Y.
Algorithms are given for constructing a polytope P with n vertices (facets), contained in (or containing) a given convex body K in , so that the ratio of the volumes |K∖P|/|K| (or |P∖K|/|K|) is smaller than .
Download Results (CSV)