Online Embeddings

13th International Workshop, APPROX 2010, and 14th International Workshop, RANDOM 2010, Barcelona, Spain, September 1-3, 2010. ProceedingsWe initiate the study of on-line metric embeddings. In such an embedding we are given a sequence of n points X = x [subscript 1],...,x [subscript n] one by one, from a metric space M = (X,D). Our goal is to compute a low-distortion embedding of M into some host space, which has to be constructed in an on-line fashion, so that the image of each x i depends only on x [subscript 1],...,x [subscript i] . We prove several results translating existing embeddings to the on-line setting, for the case of embedding into ℓ [subscript p] spaces, and into distributions over ultrametrics

New results on q-positivity

In this paper we discuss symmetrically self-dual spaces, which are simply real vector spaces with a symmetric bilinear form. Certain subsets of the space will be called q-positive, where q is the quadratic form induced by the original bilinear form. The notion of q-positivity generalizes the classical notion of the monotonicity of a subset of a product of a Banach space and its dual. Maximal q-positivity then generalizes maximal monotonicity. We discuss concepts generalizing the representations of monotone sets by convex functions, as well as the number of maximally q-positive extensions of a q-positive set. We also discuss symmetrically self-dual Banach spaces, in which we add a Banach space structure, giving new characterizations of maximal q-positivity. The paper finishes with two new examples.Comment: 18 page

Locked and Unlocked Chains of Planar Shapes

We extend linkage unfolding results from the well-studied case of polygonal linkages to the more general case of linkages of polygons. More precisely, we consider chains of nonoverlapping rigid planar shapes (Jordan regions) that are hinged together sequentially at rotatable joints. Our goal is to characterize the families of planar shapes that admit locked chains, where some configurations cannot be reached by continuous reconfiguration without self-intersection, and which families of planar shapes guarantee universal foldability, where every chain is guaranteed to have a connected configuration space. Previously, only obtuse triangles were known to admit locked shapes, and only line segments were known to guarantee universal foldability. We show that a surprisingly general family of planar shapes, called slender adornments, guarantees universal foldability: roughly, the distance from each edge along the path along the boundary of the slender adornment to each hinge should be monotone. In contrast, we show that isosceles triangles with any desired apex angle less than 90 degrees admit locked chains, which is precisely the threshold beyond which the inward-normal property no longer holds.Comment: 23 pages, 25 figures, Latex; full journal version with all proof details. (Fixed crash-induced bugs in the abstract.