Distortion lower bounds for line embeddings
نویسندگان
چکیده
Article history: Received 24 January 2008 Received in revised form 6 May 2008 Available online 20 May 2008 Communicated by C. Scheideler
منابع مشابه
Lower Bounds on Embeddings of Planar Graphs into the l1 Metric
This paper presents an overview of existing bounds on l1-embeddings of planar metrics. A new family of graphs containing the K2,3 minor is introduced. Computational results on this family of graphs establish a new lower bound on the constant in the following conjecture: There exists an absolute constant Cmax > 0 such that every finite planar metric embeds into the l1 metric with distortion < Cm...
متن کاملOn Dominated L 1 Metrics
We introduce and study a class l dom 1 () of l 1-embeddable metrics corresponding to a given metric. This class is deened as the set of all convex combinations of-dominated line metrics. Such metrics were implicitly used before in several constuctions of low-distortion embeddings into l p-spaces, such as Bourgain's embedding of an arbitrary metric on n points with O(log n) distortion. Our main ...
متن کاملDimension Reduction in the l1 norm
The Johnson-Lindenstrauss Lemma shows that any set of n points in Euclidean space can be mapped linearly down to O((log n)/ǫ) dimensions such that all pairwise distances are distorted by at most 1 + ǫ. We study the following basic question: Does there exist an analogue of the JohnsonLindenstrauss Lemma for the l1 norm? Note that Johnson-Lindenstrauss Lemma gives a linear embedding which is inde...
متن کاملOn Embeddings of $\ell_1^k$ from Locally Decodable Codes
We show that any q-query locally decodable code (LDC) gives a copy of l 1 with small distortion in the Banach space of q-linear forms on lNp1 ×· · ·× lNpq , provided 1/p1+ · · ·+1/pq ≤ 1 and where k, N , and the distortion are simple functions of the code parameters. We exhibit the copy of l 1 by constructing a basis for it directly from “smooth” LDC decoders. Based on this, we give alternative...
متن کاملGeometric complexity of embeddings in ${\mathbb R}^d$
Given a simplicial complex K , we consider several notions of geometric complexity of embeddings of K in a Euclidean space R : thickness, distortion, and refinement complexity (the minimal number of simplices needed for a PL embedding). We show that any n-complex with N simplices which topologically embeds in R , n > 2, can be PL embedded in R with refinement complexity O(e 4+ǫ ). Families of s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Inf. Process. Lett.
دوره 108 شماره
صفحات -
تاریخ انتشار 2008