Related papers: Total curvature and spiralling shortest paths

We prove that various spaces of constrained positive scalar curvature metrics on compact 3-manifolds with boundary, when not empty, are contractible. The constraints we mostly focus on are given in terms of local conditions on the mean…

We consider triangle faced convex polyhedra inscribed in the unit sphere $S^2$ in ${\Bbb{R}}^3$. One way of measuring their deviation from regular polyhedra with triangular faces is to consider the quotient of the lengths of the longest and…

We show that the shortest closed geodesic on a 2-sphere with non-negative curvature has length bounded above by three times the diameter. We prove a new isoperimetric inequality for 2-spheres with pinched curvature; this allows us to…

We prove that every three-dimensional polyhedron is uniquely determined by its dihedral angles and edge lengths, even if nonconvex or self-intersecting, under two plausible sufficient conditions: (i) the polyhedron has only convex faces and…

The paper is devoted to some extremal problems for convex curves and polygons in the Euclidean plane referring to the relative Chebyshev radius. In particular, we determine the relative Chebyshev radius for an arbitrary triangle. Moreover,…

Denote by ${\mathcal K}^d$ the family of convex bodies in $E^d$ and by $w(C)$ the minimal width of $C \in {\mathcal K}^d$. We ask for the greatest number $\Lambda_n ({\mathcal K}^d)$ such that every $C \in {\mathcal K}^d$ contains a…

Dumas, Foucaud, Perez and Todinca (2024) recently proved that every graph whose edges can be covered by $k$ shortest paths has pathwidth at most $O(3^k)$. In this paper, we improve this upper bound on the pathwidth to a polynomial one;…

This paper is a study of the interaction between the combinatorics of boundaries of convex polytopes in arbitrary dimension and their metric geometry. Let S be the boundary of a convex polytope of dimension d+1, or more generally let S be a…

In this paper we find an upper bound for the probability that a $3$ dimensional simple random walk covers each point in a nearest neighbor path connecting 0 and the boundary of an $L_1$ ball of radius $N$. For $d\ge 4$, it has been shown in…

This paper reports about the development of two provably correct approximate algorithms which calculate the Euclidean shortest path (ESP) within a given cube-curve with arbitrary accuracy, defined by $\epsilon >0$, and in time complexity…

We prove qualitative estimates on the total curvature of closed minimal hypersurfaces in closed Riemannian manifolds in terms of their index and area, restricting to the case where the hypersurface has dimension less than seven. In…

We prove that any finite polyhedral manifold in 3D can be continuously flattened into 2D while preserving intrinsic distances and avoiding crossings, answering a 19-year-old open problem, if we extend standard folding models to allow for…

A shape of a combinatorial polytope is a convex embedding into Euclidean space. We provide necessary and sufficient conditions for a piecewise linear map between two shapes of the same polytope to be a compression (respectively a weak…

We prove that computing a shortest monotone path to the optimum of a linear program over a simple polytope is NP-hard, thus resolving a 2022 open question of De Loera, Kafer, and Sanit\`a. As a consequence, finding a shortest sequence of…

The width $w$ of a curve $\gamma$ in Euclidean space $R^n$ is the infimum of the distances between all pairs of parallel hyperplanes which bound $\gamma$, while its inradius $r$ is the supremum of the radii of all spheres which are…

We show that in Euclidean 3-space any closed curve $\gamma$ which contains the unit sphere within its convex hull has length $L\geq4\pi$, and characterize the case of equality. This result generalizes the authors' recent solution to a…

We give an estimate of the mean curvature of a complete submanifold lying inside a closed cylinder $B(r)\times\R^{\ell}$ in a product Riemannian manifold $N^{n-\ell}\times\R^{\ell}$. It follows that a complete hypersurface of given constant…

We study the problem of partitioning a polygon into the minimum number of subpolygons using cuts in predetermined directions such that each resulting subpolygon satisfies a given width constraint. A polygon satisfies the unit-width…

Let $M$ be a $2$-space form. Let $P$ be a convex polygon in $M$. For these polygons, we define (and justify) a curvature $\kappa_i$ at each vertex $A_i$ of the polygon and and prove the following Blaschke's type theorem: If $P$ is a convex…

Laurent Hauswirth and Harold Rosenberg developed the theory of minimal surfaces with finite total curvature in $\H^2\times\R$. They showed that the total curvature of one such a surface must be a non-negative integer multiple of $-2\pi$.…