Related papers: A geometric approach to shortest bounded curvature…

In the paper a Riemannian structure on the tangent bundle is defined by using a statistical structure $(g,\nabla)$ on the base manifold. Expressions for various curvatures of the structure are derived. Some rigidity results of the structure…

We study the replacement paths problem in the $\mathsf{CONGEST}$ model of distributed computing. Given an $s$-$t$ shortest path $P$, the goal is to compute, for every edge $e$ in $P$, the shortest-path distance from $s$ to $t$ avoiding $e$.…

As a continuation of \cite{NSY:local}, we mainly discuss the global structure of two-dimensional locally compact geodesically complete metric spaces with curvature bounded above. We first obtain the result on the Lipschitz homotopy…

A tuple (s1,t1,s2,t2) of vertices in a simple undirected graph is 2-linked when there are two vertex-disjoint paths respectively from s1 to t1 and s2 to t2. A graph is 2-linked when all such tuples are 2-linked. We give a new and simple…

The purpose of this paper is to study low degree points on plane curves. We prove results analogous to those of Debarre and Klassen for singular plane curves with a finite number $\delta$ of ordinary nodes/cusps, where $\delta$ is bounded…

Nancy G. Kinnersley and Michael A. Langston has determined the excluded minors for the class of graphs with path-width at most two by computer. Their list consisted of 110 graphs. Such a long list is difficult to handle and gives no insight…

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…

We show how to use geometric arguments to prove that the terminal solution to a rough differential equation driven by a geometric rough path can be obtained by driving the same equation by a piecewise linear path. For this purpose, we…

A recent article by the first two authors together with B Andrews and V-M Wheeler considered the so-called `ideal curve flow', a sixth order curvature flow that seeks to deform closed planar curves to curves with least variation of total…

In this paper, we investigate the relations among various results concerning the minimal resolution of cyclic quotient singularities of the form $\mathbb{C}^2/G$. We refer to these as "bamboo-type" singularities, since the dual graphs of…

For a countable discrete group {\Gamma} and a minimal {\Gamma}-space X, we study the notion of ({\Gamma}, X)-boundary, which is a natural generalization of the notion of topological {\Gamma}-boundary in the sense of Furstenberg. We give…

Given a set $\mathcal{P}$ of $h$ pairwise disjoint simple polygonal obstacles in $\mathbb{R}^2$ defined with $n$ vertices, we compute a sketch $\Omega$ of $\mathcal{P}$ whose size is independent of $n$, depending only on $h$ and the input…

We obtain a recursive formula for the characteristic number of degree $d$ curves in $\mathbb{P}^2$ with prescribed singularities (of type $A_k$) that are tangent to a given line. The formula is in terms of the characteristic number of…

There is an elegant relation found by Fabricius-Bjerre [Math. Scand 40 (1977) 20--24] among the double tangent lines, crossings, inflections points, and cusps of a singular curve in the plane. We give a new generalization to singular curves…

We derive curvature estimates for minimal submanifolds in Euclidean space for arbitrary dimension and codimension via Gauss map. Thus, Schoen-Simon-Yau's results and Ecker-Huisken's results are generalized to higher codimension. In this way…

A covering problem posed by Henri Lebesgue in 1914 seeks to find the convex shape of smallest area that contains a subset congruent to any point set of unit diameter in the Euclidean plane. Methods used previously to construct such a…

Computing a shortest path between two nodes in an undirected unweighted graph is among the most basic algorithmic tasks. Breadth first search solves this problem in linear time, which is clearly also a lower bound in the worst case.…

The problem of finding the shortest path for a vehicle visiting a given sequence of target points subject to the motion constraints of the vehicle is an important problem that arises in several monitoring and surveillance applications…

We make evident a curvature tensor for every vector sub-bundle of an arbitrary manifold tangent bundle which reduces to the curvature tensor of an Ehresmann connection in the case of the horizontal sub-bundle of the tangent bundle to the…

For two vertices $s$ and $t$ in a graph $G=(V,E)$, the next-to-shortest path is an $st$-path which length is minimum amongst all $st$-paths strictly longer than the shortest path length. In this paper we show that, when the graph is…