Related papers: Geodesic complexity of a cube
A periodic geodesic on a surface has a natural lift to the unit tangent bundle; when the complement of this lift is hyperbolic, its volume typically grows as the geodesic gets longer. We give an upper bound for this volume which is linear…
We give a universal upper bound for the total curvature of minimizing geodesic on a convex surface in the Euclidean space.
We consider three variants of the problem of finding a maximum weight restricted $2$-matching in a subcubic graph $G$. (A $2$-matching is any subset of the edges such that each vertex is incident to at most two of its edges.) Depending on…
In a previous effort [arXiv:1708.05492] we have created a framework that explains why topological structures naturally arise within a scientific theory; namely, they capture the requirements of experimental verification. This is…
Topological complexity is a numerical homotopy invariant that measures the instability of motion planning in a space. To study the topological complexity of non-simply connected spaces, Costa and Farber introduced a cohomology class whose…
We present upper and lower bounds for symmetrized topological complexity $TC^\Sigma(X)$ in the sense of Basabe-Gonz\'alez-Rudyak-Tamaki. The upper bound comes from equivariant obstruction theory, and the lower bounds from the cohomology of…
According to the pioneering work of Nielsen and collaborators, the length of the minimal geodesic in a geometric realization of a suitable operator space provides a measure of the quantum complexity of an operation. Compared with the…
We construct a linear system on a general curve in a totally geodesic subvariety of the moduli space of curves. As a consequence, we obtain rank bounds for totally geodesic subvarieties of dimension at least two. Furthermore, we classify…
Except for crystalline or random structures, an agreed definition of complexity for intermediate and hence interesting cases does not exist. We fill this gap with a notion of complexity that characterises shapes formed by any finite number…
This research is motivated by studying image processing algorithms through a topological lens. The images we focus on here are those that have been segmented by digital Jordan curves as a means of image compression. The algorithms of…
Complex algebraic varieties become easy piecewise-linear objects after passing to the so-called tropical limit. Geometry of these limiting objects is known as tropical geometry. In this short survey we take a look at motivation and…
A cube is an 8-rep-tile: it is the union of eight smaller copies of itself. Is there a set with a hole which has this property? The computer found an interesting and complicated solution, which then could be simplified. We discuss some…
It is known that the shortest non-simple closed geodesic on an orientable hyperbolic 2-orbifold passes through an orbifold point of the orbifold. This raises questions about minimal length non-simple closed geodesics disjoint from the…
Computing an array of all pairs of geodesic distances between the pixels of an image is time consuming. In the sequel, we introduce new methods exploiting the redundancy of geodesic propagations and compare them to an existing one. We show…
The minimum distance is one of the most important combinatorial characterizations of a code. The maximum likelihood decoding problem is one of the most important algorithmic problems of a code. While these problems are known to be hard for…
The geometric intersection number of a curve on a surface is the minimal number of self-intersections of any homotopic curve, i.e. of any curve obtained by continuous deformation. Given a curve $c$ represented by a closed walk of length at…
A geodesic in a graph G is a shortest path between two vertices of G. For a specific function e(n) of n, we define an almost geodesic cycle C in G to be a cycle in which for every two vertices u and v in C, the distance d_G(u,v) is at least…
We extend Matveev's complexity of 3-manifolds to PL compact manifolds of arbitrary dimension, and we study its properties. The complexity of a manifold is the minimum number of vertices in a simple spine. We study how this quantity changes…
We construct a template with two ribbons that describes the topology of all periodic orbits of the geodesic flow on the unit tangent bundle to any sphere with three cone points with hyperbolic metric. The construction relies on the…
How hard is it to program $n$ robots to move about a long narrow aisle such that only $w$ of them can fit across the width of the aisle? In this paper, we answer that question by calculating the topological complexity of $\text{conf}(n,w)$,…