520 research outputs found

    On the complexity of optimal homotopies

    Get PDF
    In this article, we provide new structural results and algorithms for the Homotopy Height problem. In broad terms, this problem quantifies how much a curve on a surface needs to be stretched to sweep continuously between two positions. More precisely, given two homotopic curves γ1\gamma_1 and γ2\gamma_2 on a combinatorial (say, triangulated) surface, we investigate the problem of computing a homotopy between γ1\gamma_1 and γ2\gamma_2 where the length of the longest intermediate curve is minimized. Such optimal homotopies are relevant for a wide range of purposes, from very theoretical questions in quantitative homotopy theory to more practical applications such as similarity measures on meshes and graph searching problems. We prove that Homotopy Height is in the complexity class NP, and the corresponding exponential algorithm is the best one known for this problem. This result builds on a structural theorem on monotonicity of optimal homotopies, which is proved in a companion paper. Then we show that this problem encompasses the Homotopic Fr\'echet distance problem which we therefore also establish to be in NP, answering a question which has previously been considered in several different settings. We also provide an O(log n)-approximation algorithm for Homotopy Height on surfaces by adapting an earlier algorithm of Har-Peled, Nayyeri, Salvatipour and Sidiropoulos in the planar setting

    Spectrally Similar Incommensurable 3-Manifolds

    Get PDF
    Reid has asked whether hyperbolic manifolds with the same geodesic length spectrum must be commensurable. Building toward a negative answer to this question, we construct examples of hyperbolic 3–manifolds that share an arbitrarily large portion of the length spectrum but are not commensurable. More precisely, for every n ≫ 0, we construct a pair of incommensurable hyperbolic 3–manifolds Nn and Nµn whose volume is approximately n and whose length spectra agree up to length n. Both Nn and Nµn are built by gluing two standard submanifolds along a complicated pseudo-Anosov map, ensuring that these manifolds have a very thick collar about an essential surface. The two gluing maps differ by a hyper-elliptic involution along this surface. Our proof also involves a new commensurability criterion based on pairs of pants

    Constructing monotone homotopies and sweepouts

    Full text link
    This article investigates when homotopies can be converted to monotone homotopies without increasing the lengths of curves. A monotone homotopy is one which consists of curves which are simple or constant, and in which curves are pairwise disjoint. We show that, if the boundary of a Riemannian disc can be contracted through curves of length less than LL, then it can also be contracted monotonously through curves of length less than LL. This proves a conjecture of Chambers and Rotman. Additionally, any sweepout of a Riemannian 22-sphere through curves of length less than LL can be replaced with a monotone sweepout through curves of length less than LL. Applications of these results are also discussed.Comment: 16 pages, 6 figure

    Spectrally Similar Incommensurable 3-Manifolds

    Get PDF
    Reid has asked whether hyperbolic manifolds with the same geodesic length spectrum must be commensurable. Building toward a negative answer to this question, we construct examples of hyperbolic 3–manifolds that share an arbitrarily large portion of the length spectrum but are not commensurable. More precisely, for every n ≫ 0, we construct a pair of incommensurable hyperbolic 3–manifolds Nn and Nµn whose volume is approximately n and whose length spectra agree up to length n. Both Nn and Nµn are built by gluing two standard submanifolds along a complicated pseudo-Anosov map, ensuring that these manifolds have a very thick collar about an essential surface. The two gluing maps differ by a hyper-elliptic involution along this surface. Our proof also involves a new commensurability criterion based on pairs of pants

    Generalized Markoff Maps and McShane's Identity

    Get PDF
    We study general representations of the free group on two generators into SL(2,C)SL(2,C), and the connection with generalized Markoff maps, following Bowditch. We show that Bowditch's Q-conditions for generalized Markoff maps are sufficient for the generalized McShane identity to hold for the corresponding representations and that the subset of representations satisfying these conditions is the largest open subset in the relative character variety on which the mapping class group acts properly discontinuously. Moreover we generalize Bowditch's results on variations of McShane's identity for complete, finite volume hyperbolic 3-manifolds which fiber over the circle, with the fiber a punctured-torus, to identities for incomplete hyperbolic structures on such manifolds, hence obtaining identities for closed hyperbolic 3-manifolds which are obtained by doing hyperbolic Dehn surgery on such manifolds.Comment: 49 pages, 9 figure

    Integrability of Lie brackets

    Get PDF
    In this paper we present the solution to a longstanding problem of differential geometry: Lie's third theorem for Lie algebroids. We show that the integrability problem is controlled by two computable obstructions. As applications we derive, explain and improve the known integrability results, we establish integrability by local Lie groupoids, we clarify the smoothness of the Poisson sigma-model for Poisson manifolds, and we describe other geometrical applications.Comment: 46 pages, published versio

    How to Walk Your Dog in the Mountains with No Magic Leash

    Full text link
    We describe a O(logn)O(\log n )-approximation algorithm for computing the homotopic \Frechet distance between two polygonal curves that lie on the boundary of a triangulated topological disk. Prior to this work, algorithms were known only for curves on the Euclidean plane with polygonal obstacles. A key technical ingredient in our analysis is a O(logn)O(\log n)-approximation algorithm for computing the minimum height of a homotopy between two curves. No algorithms were previously known for approximating this parameter. Surprisingly, it is not even known if computing either the homotopic \Frechet distance, or the minimum height of a homotopy, is in NP
    corecore