Related papers: Length minimising bounded curvature paths in homot…

This final degree project is devoted to study the topological classification of complex plane curves. These are subsets of $\mathbb{C}^2$ that can be described by an equation $f(x,y)=0$. Loosely speaking, curves are said to be equivalent in…

Let M be a smooth strictly convex closed surface in space and denote by H the set of points x in the exterior of M such that all the tangent segments from x to M have equal lengths. In this note we prove that if H is either a closed surface…

The $n$-dimensional binary hypercube is the graph whose vertices are the binary $n$-tuples $\{0, 1\}^n$ and where two vertices are connected by an edge if they differ at exactly one coordinate. We prove that if the edges are assigned…

We consider the motion planning problem for a point constrained to move along a smooth closed convex path of bounded curvature. The workspace of the moving point is bounded by a convex polygon with m vertices, containing an obstacle in a…

In this paper we provide a criterion for the quasi-autonomous Hamiltonian path (``Hofer's geodesic'') on arbitrary closed symplectic manifolds $(M,\omega)$ to be length minimizing in its homotopy class in terms of the spectral invariants…

We consider embedded, smooth curves in the plane which are either closed or asymptotic to two lines. We study their behaviour under curve shortening flow with a global forcing term. Firstly, we prove an analogue to Huisken's distance…

In this paper we provide a method of finding possible numbers of shortest paths between two points in a space of compact sets in Euclidean space with Hausdorff distance. We also prove that there cannot be some of the numbers of shortest…

In this paper, we establish compactness for various geometric curvature energies including integral Menger curvature, and tangent-point repulsive potentials, defined a priori on the class of compact, embedded $m$-dimensional Lipschitz…

Let a and b be two positive integers. A culminating path is a path of Z^2 that starts from (0,0), consists of steps (1,a) and (1,-b), stays above the x-axis and ends at the highest ordinate it ever reaches. These paths were first…

We present two models for the space of knots which have endpoints at fixed boundary points in a manifold with boundary, one model defined as an inverse limit of spaces of maps between configuration spaces and another which is cosimplicial.…

It is hereby established that, in Euclidean spaces of finite dimension, bounded self-contracted curves have finite length. This extends the main result of Daniilidis, Ley, and Sabourau (J. Math. Pures Appl. 2010) concerning continuous…

Two-stage methods addressing continuous shortest path problems start local minimization from discrete shortest paths in a spatial graph. The convergence of such hybrid methods to global minimizers hinges on the discretization error induced…

The detour between two points u and v (on edges or vertices) of an embedded planar graph whose edges are curves is the ratio between the shortest path in in the graph between u and v and their Euclidean distance. The maximum detour over all…

We prove integral curvature bounds in terms of the Betti numbers for compact submanifolds of the Euclidean space with low codimension. As an application, we obtain topological obstructions for $\delta$-pinched immersions. Furthermore, we…

The Dubins interval problem aims to find the shortest path of bounded curvature between two targets such that the departure angle from the first target and the arrival angle at the second target are constrained to two respective intervals.…

We introduce the concept of parametrized homotopic distance, extending the classical notion of homotopic distance to the fibrewise setting. We establish its correspondence with the fibrewise sectional category of a specific fibrewise…

We prove a limit shape theorem describing the asymptotic shape of bumping routes when the Robinson-Schensted algorithm is applied to a finite sequence of independent, identically distributed random variables with the uniform distribution…

We study a class of directed random graphs. In these graphs, the interval [0,x] is the vertex set, and from each y\in [0,x], directed links are drawn to points in the interval (y,x] which are chosen uniformly with density one. We analyze…

We prove consistency of four different approaches to formalizing the idea of minimum average edge-length in a path linking some infinite subset of points of a Poisson process. The approaches are (i) shortest path from origin through some…

In this work we describe a class of subsets of the Euclidean plane which, with the induced length metric, are locally $CAT(0)$ spaces and we show that the gluing of two such subsets along a piece of their boundary is again a locally…