Related papers: Length minimising bounded curvature paths in homot…

The Dirichlet Laplacian in a curved three-dimensional tube built along a spatial (bounded or unbounded) curve is investigated in the limit when the uniform cross-section of the tube diminishes. Both deformations due to bending and twisting…

Let $B$ be a point robot moving in the plane, whose path is constrained to forward motions with curvature at most one, and let $P$ be a convex polygon with $n$ vertices. Given a starting configuration (a location and a direction of travel)…

We show, for mean curvature flows in Euclidean space, that if one of the tangent flows at a given space-time point consists of a closed, multiplicity-one, smoothly embedded self-similar shrinker, then it is the unique tangent flow at that…

We prove the existence of families of distinct isotopy classes of physical unknots through the key concept of parametrised thickness. These unknots have prescribed length, tube thickness, a uniform bound on curvature, and cannot be…

(I) We prove that the (maximum) number of monotone paths in a geometric triangulation of $n$ points in the plane is $O(1.7864^n)$. This improves an earlier upper bound of $O(1.8393^n)$; the current best lower bound is $\Omega(1.7003^n)$.…

We give a sharp lower bound for the energy in homotopy classes of mappings from real projective space to Riemannian manifolds, together with an upper bound for its infimum. We characterize the maps which attain this lower bound for energy,…

We establish tight lower and upper bounds on the number of edges in traceable graphs in several classes of dense graphs. A graph is traceable if it has a Hamiltonian path. We show that the bound is: - quadratic for the class of graphs of…

For a pair of points $x,y$ in a compact, riemannian manifold $M$ let $n_t(x,y)$ (resp. $s_t(x,y)$) be the number of geodesic segments with length $\leq t$ joining these points (resp. the minimal number of point obstacles needed to block…

We give a metric characterization of the Euclidean sphere in terms of the lower bound of the sectional curvature and the length of the shortest closed geodesics.

We give a metric characterization of the Euclidean sphere in terms of the lower bound of the sectional curvature and the length of the shortest closed geodesics.

The main purpose of this paper is to study the length minimizing property of Hamiltonian paths on closed symplectic manifolds $(M,\omega)$ such that there are no spherical homology class $A \in H_2(M)$ with $$ \omega(A) > 0 \quad \text{and}…

We show that length minimizing curves in Carnot-Carath\'eodory spaces possess at any point at least one tangent curve (i.e., a blow-up in the nilpotent approximation) equal to a straight horizontal line. This is the first regularity result…

We investigate the consequences of timelike sectional curvature bounds in Lorentzian length spaces for the existence and structure of the space of directions at a point. It is established that, under upper timelike sectional curvature…

We address the problem of bounding from below the self-intersection of integral curves on the projective plane blown-up at general points. In particular, by applying classical deformation theory we obtain the expected bound in the case of…

Consider a closed manifold $M$ immersed in $\R^m.$ Suppose that the trivial bundle $M\times\R^m=TM\otimes \nu M$ is equipped with an almost metric connection $\tilde{\nabla}$ which almost preserves the decomposition of $M\times\R^m$ into…

We give a universal upper bound for the total curvature of minimizing geodesic on a convex surface in the Euclidean space.

In this paper we prove that a complete minimal surface immersed in H^2xR, with finite total curvature and two ends, each one asymptotic to a vertical geodesic plane, must be a horizontal catenoid. Moreover, we give a geometric description…

We approximate boundaries of convex polytopes by smooth hypersurfaces $Y=Y_\varepsilon$ with {\it positive mean curvatures} and, by using basic geometric relations between the scalar curvatures of Riemannin manifolds and the mean curvatures…

We study the problem of finding a triangulation T of a planar point set S such as to minimize the expected distance between two points x and y chosen uniformly at random from S. By distance we mean the length of the shortest path between x…

Given a plane curve $\gamma: S^1\to \mathbb R^2$, we consider the problem of determining the minimal number $I(\gamma)$ of inflections which curves $\mbox{diff}(\gamma)$ may have, where $\mbox{diff}$ runs over the group of diffeomorphisms…