The paper finds bounds on shortest dense curves on surfaces.
problem Finding shortest dense curves on surfaces.
method Quantitative density of closed geodesics and orthogeodesics.
result Upper bounds on shortest dense curves.
Study shortest non-separating curves on non-orientable surfaces, proving NP-hardness and tractability.
problem Computing shortest non-separating simple closed curves on non-orientable surfaces.
method Developed tools for computing shortest curves, proving NP-hardness and tractability.
result Proved NP-hardness and fixed-parameter tractability for computing shortest orienting curves, and polynomial-time algorithm for non-orienting curves.
Shortest geodesic on curved spheres is no longer than 3 times the diameter.
problem Finding the shortest closed geodesic on spheres with positive curvature.
method Proved a new isoperimetric inequality for spheres with pinched curvature, used to improve the bound on the shortest geodesic.
result The shortest closed geodesic is no longer than 3 times the diameter of the sphere.
Algorithms find second and third shortest non-trivial closed walks on surfaces.
problem Finding non-trivial closed walks on surfaces efficiently.
method Algorithms based on careful analysis of shortest curves and configurations.
result Second shortest walk found in O(n2logn) time, third in O(n3) time. A curve around a sphere must be at least 4π long.
problem Finding the shortest closed curve that encloses a sphere.
method Analyzing curves in Euclidean 3-space and comparing their lengths.
result The shortest curve is composed of 4 semicircles arranged like a baseball seam.
Improved bounds on shortest geodesics with self-intersections on hyperbolic surfaces.
problem Quantifying the complexity of non-simple closed geodesics on hyperbolic surfaces.
method Analyzing the geometry of shortest figure eight curves and constructing geodesic representatives.
result Explicit upper bounds for the length of shortest geodesics with k self-intersections improved from 512 to 128. Study shortest non-simple geodesics on 2-orbifolds, finding unique shortest curve.
problem Finding shortest non-simple closed geodesics disjoint from orbifold points.
method Fundamental domains and hyperbolic trigonometry.
result Identified and classified all figure eight geodesics on triangle group orbifolds.
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.
Study bounds the length of shortest periodic geodesics on certain curved spaces.
problem Bounding the length of shortest periodic geodesics on curved spaces.
method Analyzing the space of closed loops and their homotopy.
result The length of a shortest periodic geodesic is bounded by 8π(n−1). A curve of minimum length to enclose a unit sphere in 3D is at least 4π.
problem Finding the shortest closed curve that encloses a unit sphere within its convex hull.
method Analyzing the geometric properties and using convex hull concepts.
result The minimum length of such a curve is 4π in 3D, with equality in a specific case.
Any finite configuration of curves with minimal intersections on a surface is a configuration of shortest geodesics for some Riemannian metric on the surface. The metric can be chosen to make the lengths of these geodesics equal to the number of intersections along them.
There are many equivalent definitions of Riemannian geodesics. They are naturally generalised to sub-Riemannian manifold, but become non-equivalent. We give a review of different definitions of geodesics of a sub-Riemannian manifold and interrelation between them. We recall three variational definitions of geodesics as…
We show that the volume of any Riemannian metric on a three sphere is bounded below by the length of the shortest closed curve that links its antipodal image. In particular, the volume is bounded below by the minimum of the length of the shortest closed geodesic and the minimal distance between antipodal points.
New proof confirms surfaces can be divided into polygons.
problem Estimating the dimension of Thurston spine.
method Existence of an infinite set A, proving codimension is o(g/ log g).
result Proves recent conjecture about Thurston spine dimension.
Sharp bounds found on shortest geodesic on punctured spheres.
problem Finding the shortest closed geodesic on punctured spheres.
method Sharp curvature-free upper bounds expressed in terms of area, extremal metrics described.
result Optimal bounds for spheres with up to four ends, extended to larger numbers of punctures.
We bound the dimension of the fiber of a Riemannian submersion from a positively curved manifold in terms of the dimension of the base of the submersion and either its conjugate radius or the length of its shortest closed geodesic.
New bounds on shortest geodesic loops on a sphere.
problem Finding shortest geodesic loops on a sphere.
method Analyzing geodesic loops starting and ending at a fixed point on a sphere.
result At any point on a sphere, there are at least two distinct geodesic loops whose lengths are bounded by 8d and 14d.
Optimizes the first eigenvalues of Riemann surfaces for large genus.
problem Finding optimal lower bounds for first eigenvalues of Riemann surfaces.
method Analyzing shortest multi-closed curves to establish a new lower bound.
result The first eigenvalue of a Riemann surface is greater than a specific formula involving the genus and a constant.
Spirals are not shortest paths in certain sub-Riemannian geometries.
problem Nonminimality of spiral-like curves in sub-Riemannian manifolds.
method Construction of a competing curve to demonstrate non-minimality.
result Spiral-like curves are not length minimizing in sub-Riemannian manifolds.
We give a lower bound for the widths of the collars of certain short partial pants decomposition of the surface. Then we apply this to obtain upper bounds of the renormalized volume of certain Schottky manifolds in terms of the hyperbolic length of compressible curves.
This note is about a type of quantitative density of closed geodesics on closed hyperbolic surfaces. The main results are upper bounds on the length of the shortest closed geodesic that ε-fills the surface.
The distortion of a curve measures the maximum arc/chord length ratio. Gromov showed any closed curve has distortion at least pi/2 and asked about the distortion of knots. Here, we prove that any nontrivial tame knot has distortion at least 5pi/3; examples show that distortion under 7.16 suffices to build a trefoil kno…
We show that the largest subsurface projection distance between a marking and its image under the nth step of a random walk grows logarithmically in n, with probability approaching 1 as n tends to infinity. Our setup is general and also applies to (relatively) hyperbolic groups and to Out(Fn). We then use t…
This paper classifies and determines the length of the shortest filling pairs on a specific type of surface.
problem Classifying and determining the length of the shortest filling pairs on a specific type of surface.
method Classifying and determining the length of the shortest filling pairs on a specific type of surface.
result The paper classifies and determines the length of the shortest minimal filling pairs on a genus two surface.
Undergrad project: Shows geodesics coincide in Heisenberg group under two metrics.
problem Identifying geodesics in Heisenberg group under two metrics.
method Examined Heisenberg group H1 with Koranyi- and Carnot-Caratheodory metrics.
result Geodesics coincide for both metrics in Heisenberg group.
Geodesics in 3D space with 1-2 analytic obstacles, proving geodesic independence.
problem Understanding geodesics in 3D space with obstacles.
method Analyzing algebraic varieties and strata, proving geodesic independence.
result Proving geodesic independence in R3 and generalizing to two intersecting obstacles. Paper proves curves can be smoothed to reduce self-intersection by exactly 1.
problem Prove that the shortest closed geodesic self-intersects exactly k times.
method Carefully smoothing intersection points reduces self-intersection by exactly 1.
result The shortest closed geodesic self-intersects exactly k times for hyperbolic and Riemannian metrics.
What length of rope (of given diameter) is required to tie a particular knot? To answer this question, we define some new notions of thickness for a space curve, one based on Gromov's distortion, and another generalizing the thickness of Litherland, Simon et al. We prove a basic inequality between these thickness measu…
If a variational problem comes with no boundary conditions prescribed beforehand, and yet these arise as a consequence of the variation process itself, we speak of a free boundary values variational problem. Such is, for instance, the problem of finding the shortest curve whose endpoints can slide along two prescribed …
Relatively extremal knots are the relative minima of the ropelength functional in C^1 topology. On the set curves of fixed length, they are the relative maxima of thickness (normal injectivity radius) functional, including the ideal knots. We prove that a C^{1,1} relatively extremal knot in R^n has thickness equal to h…
Let C(Sg,p) denote the curve complex of the closed orientable surface of genus g with p punctures. Masur-Minksy and subsequently Bowditch showed that C(Sg,p) is δ-hyperbolic for some δ=δ(g,p). In this paper, we show that there exists some δ>0 independent of g,p such that the cu…
The study of random surfaces reveals asymptotic lengths of separating geodesics.
problem Understanding geometric properties of random hyperbolic surfaces.
method Analysis of Weil-Petersson measure and asymptotic behavior of lengths.
result The shortest separating closed geodesics have lengths about 2logg. Study geodesics and shortest arcs on Lie groups with specific metrics.
problem Characterize geodesics and shortest paths on Lie groups with sub-Riemannian metrics.
method Analytical and geometric methods to find geodesics and shortest arcs.
result Found geodesics, shortest arcs, distances, and conjugate loci for specified metrics.
The paper studies the shortest closed multi-geodesics on hyperbolic surfaces as their genus grows.
problem Finding the asymptotic behavior of shortest closed multi-geodesics on hyperbolic surfaces.
method Analyzing the length of shortest filling closed multi-geodesics using hyperbolic geometry and asymptotic analysis.
result The length of a shortest filling closed multi-geodesic is uniformly comparable to a specific formula involving the genus and lengths of closed geodesics.
Study geodesics and shortest arcs on Lie groups with specific metrics.
problem Characterize geodesics and shortest arcs in sub-Riemannian metrics on Lie groups.
method Investigated left-invariant sub-Riemannian metrics on SU(1,1)imesR and SO0(2,1)imesR. result Found geodesics, shortest arcs, cut loci, and conjugate loci.
It is a classical theorem of Loewner that the systole of a Riemannian torus can be bounded in terms of its area. We answer a question of a similar flavor of Robert Young showing that if T is a Riemannian 2-torus with boundary in Rn, such that the boundary curve is a standard unit circle, then the length o…
Generative Flow Networks solve shortest path problems in graphs.
problem Finding shortest paths in graphs.
method Generative Flow Networks with flow regularization.
result Training a GFlowNet can solve pathfinding problems in arbitrary graphs.
Deep learning approximates shortest path distances in large graphs.
problem Scaling up shortest path distance computation in large networks.
method Deep learning techniques to approximate distances using vector embeddings.
result Feedforward neural networks with embeddings can approximate distances with low distortion error.
In this paper we study 1/k geodesics, those closed geodesics that minimize on all subintervals of length L/k, where L is the length of the geodesic. We develop new techniques to study the minimizing properties of these curves on doubled polygons, and demonstrate a sequence of doubled polygons whose closed geodesics…
Origami edge-paths connect coherent curves on surfaces.
problem Understanding coherent curves on surfaces.
method Origami structure and edge-paths.
result Existence of origami edge-paths connecting coherent curves.
The paper finds shortest geodesic bounds on orbifolds with diameter limits.
problem Bounding the shortest closed geodesic on compact orbifolds.
method Generalizing length-bounded sweepouts to orbifolds.
result Established an inequality linking shortest geodesic length to orbifold diameter.
Study on shortest arcs on hyperbolic surfaces with boundary.
problem Characterize and maximize the length of shortest essential arcs on hyperbolic surfaces with geodesic boundaries.
method Analyze hyperbolic surfaces with multiple boundary components, construct surfaces with large orthosystole, and compare growth rates.
result Orthosystole grows at the same rate as Bavard's upper bound as the genus increases.
Study finds bounds for systole length on arithmetic punctured spheres.
problem Finding the shortest essential curve on arithmetic punctured spheres.
method Correspondence between surfaces and planar triangulations to bound systole length.
result Arithmetic surfaces do not achieve maximal systole length for n=7,10,11. We define and study a discrete process that generalizes the convex-layer decomposition of a planar point set. Our process, which we call "homotopic curve shortening" (HCS), starts with a closed curve (which might self-intersect) in the presence of a set P⊂R2 of point obstacles, and evolves in discrete…
3D spheres can't be swept by short curves, complicating geodesic length estimates.
problem Obstructing geodesic length estimates in 3D spheres.
method Constructing specific 3D spheres with controlled diameter and volume.
result Min-max methods for geodesic lengths fail for certain 3D spheres.
Geodesics connect model modes in neural network loss landscapes.
problem Connecting modes in neural network loss landscapes.
method Reframed mode connectivity in Information Geometry, hypothesized geodesics as mode-connecting paths, proposed algorithm to approximate geodesics.
result Geodesics achieve mode connectivity in neural networks.
Algorithms compute length spectra of torus graphs efficiently.
problem Computing length spectra of graphs embedded on a torus.
method Preprocessing and algorithms based on polyhedral norms.
result Efficient computation of length spectra and spectrum comparison.