Related papers: Geodesic complexity of a cube
We consider the problem of determining the length of the shortest paths between points on the surfaces of tetrahedra and cubes. Our approach parallels the concept of Alexandrov's star unfolding but focuses on specific polyhedra and uses…
The embeddability of graphs into surfaces has been studied for nearly a century. While the complete set of topological obstructions is known for the sphere and the real projective plane, there are only partial results for the torus. Here we…
Comparing and computing distances between phylogenetic trees are important biological problems, especially for models where edge lengths play an important role. The geodesic distance measure between two phylogenetic trees with edge lengths…
The landscapes of a polyhedron are subsets of its nets one must consider to identify all shortest paths. Landscapes of cubes and tetrahedra have been used to identify coordinate based formulas for the lengths of the shortest paths between…
We compute the higher topological complexity of ordered configuration spaces of orientable surfaces, thus extending Cohen-Farber's description of the ordinary topological complexity of those spaces.
A Gauss equation is proved for subspaces of Alexandrov spaces of curvature bounded above by K. That is, a subspace of extrinsic curvature less than or equal to A, defined by a cubic inequality on the difference of arc and chord, has…
An obstacle representation of a graph is a mapping of the vertices onto points in the plane and a set of connected regions of the plane (called obstacles) such that the straight-line segment connecting the points corresponding to two…
A solution to the problem of topological classification of real cubic fourfolds is presented. It is shown that the real locus of a real non-singular cubic fourfold is obtained from a projective 4-space either by adding several trivial one-…
We characterize the complexity of geodesic paths on a curved statistical manifold M_{s} through the asymptotic computation of the information geometric complexity V_{M_{s}} and the Jacobi vector field intensity J_{M_{s}}. The manifold M_{s}…
Several physical problems such as the `twin paradox' in curved spacetimes have purely geometrical nature and may be reduced to studying properties of bundles of timelike geodesics. The paper is a general introduction to systematic…
We study closed orientable manifolds whose topological complexity is at most 3 and determine their cohomology rings. For some of admissible cohomology rings we are also able to identify corresponding manifolds up to homeomorphism.
Topological data analysis asks when balls in a metric space $(X,d)$ intersect. Geometric data analysis asks how much balls have to be enlarged to intersect. We connect this principle to the traditional core geometric concept of curvature.…
We exhibit orbits of the geodesic flow on a hyperbolic surface with at least one cusp such that every tubular neighborhood contains uncountably many distinct geodesic flow orbits. The proof relies on new phenomena, namely the existence of…
We define a simpler notion of symmetric topological complexity more ad hoc to the motion planning problem which was the original motivation for the definition of topological complexity. This is a homotopy invariant that we call…
We study configurations of immersed curves in surfaces and surfaces in 3-manifolds. Among other results, we show that primitive curves have only finitely many configurations which minimize the number of double points. We give examples of…
A partial cube is a graph having an isometric embedding in a hypercube. Partial cubes are characterized by a natural equivalence relation on the edges, whose classes are called zones. The number of zones determines the minimal dimension of…
We consider the following questions: given a hyperbolic plane domain and a separation of its complement into two disjoint closed sets each of which contains at least two points, what is the shortest closed hyperbolic geodesic which…
We prove Farber's conjecture on the stable topological complexity of configuration spaces of graphs. The conjecture follows from a general lower bound derived from recent insights into the topological complexity of aspherical spaces. Our…
Geometric complexity theory (GCT) is an approach to the P vs. NP and related problems. This article gives its complexity theoretic overview without assuming any background in algebraic geometry or representation theory.
Topological complexity $\TC{B}$ of a space $B$ is introduced by M. Farber to measure how much complex the space is, which is first considered on a configuration space of a motion planning of a robot arm. We also consider a stronger version…