相关论文: The geodesic complexity of n-dimensional Klein bot…

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…

In many singular metric spaces, the regularity of a shortest-length curve is unknown. Algebraic varieties, or more generally sets defined by finitely many polynomial or real analytic equalities or inequalities, all locally partition into…

In Nielsen's geometric approach to quantum complexity, the introduction of a suitable geometrical space, based on the Lie group formed by fundamental operators, facilitates the identification of complexity through geodesic distance in the…

Donald Davis initiated the study of an $n$-dimensional analogue of the Klein bottle. This generalized Klein bottle occurs as a moduli space of planar polygons for a certain choice of side lengths. In this paper, we show that the…

We study the higher (sequential) topological complexity, a numerical homotopy invariant for the planar polygon spaces. For these spaces with a small genetic codes and dimension $m$, Davis showed that their topological complexity is either…

Let M be a (possibly non-orientable) compact 3-manifold with (possibly empty) boundary consisting of tori and Klein bottles. Let $X\subset\partial M$ be a trivalent graph such that $\partial M\setminus X$ is a union of one disc for each…

We study the geodesic complexity of the ordered and unordered configuration spaces of graphs in both the $\ell_1$ and $\ell_2$ metrics. We determine the geodesic complexity of the ordered two-point $\varepsilon$-configuration space of any…

This paper studies the geodesic diameter of polygonal domains having h holes and n corners. For simple polygons (i.e., h = 0), the geodesic diameter is determined by a pair of corners of a given polygon and can be computed in linear time,…

Using known results about their mod-2 cohomology ring, we prove that the topological complexity of the space of isometry classes of n-gons in the plane with one side of length r and all others of length 1 equals either 2n-5 or 2n-6,…

In this paper we study 1/k-geodesics, those closed geodesics that minimize on any subinterval of length $L/k$, where $L$ is the length of the geodesic. We investigate the existence and behavior of these curves on doubled polygons and show…

We present numerical polyhedron data for the image of a piecewise-linear map from a zero-curvature Klein bottle into Euclidean 3-space such that every point in the domain has a neighborhood which is isometrically embedded. To the author's…

Let $K$ be a Klein bottle. We show that the infimum of the Willmore energy among all immersed Klein bottles in Euclidean $n$-space is attained by a smooth embedded Klein bottle, where $n\geq 4$. There are three distinct regular homotopy…

We determine lower bounds for the topological complexity of many planar polygon spaces mod isometry. With very few exceptions, the upper and lower bounds given by dimension and cohomology considerations differ by 1. This is true for 130 of…

The geodesic $k$-center problem in a simple polygon with $n$ vertices consists in the following. Find a set $S$ of $k$ points in the polygon that minimizes the maximum geodesic distance from any point of the polygon to its closest point in…

Let $K\subseteq{\mathbb R}^n$ be a convex semialgebraic set. The semidefinite extension degree ${\mathrm{sxdeg}}(K)$ of $K$ is the smallest number $d$ such that $K$ is a linear image of an intersection of finitely many spectrahedra, each of…

We present an explicit piecewise linear map from a flat Klein bottle (i.e. one that is locally isometric to the Euclidean plane) into Euclidean 3-space an that is an isometric immersion -- a path isometry that is locally injective. The…

We use some detailed knowledge of the cohomology ring of real Grassmann manifolds $G_k(\mathbb{R}^n)$ to compute zero-divisor cup-length and estimate topological complexity of motion planning for $k$-linear subspaces in $\mathbb{R}^n$. In…

Graphs that are critical (minimal excluded minors) for embeddability in surfaces are studied. In Part I we consider the structure of graphs with a 2-vertex-cut that are critical with respect to the Euler genus. A general theorem describing…

Hausmann and Rodriguez classified spaces of isometry classes of planar n-gons according to their genetic code, which is a collection of sets (called genes) containing n. Omitting the n yields what we call gees. We prove that, for a set of…

In this paper, we examine how topological complexity, simplicial complexity, discrete topological complexity, and combinatorial complexity compare when applied to models of $S^1$. We prove that the topological complexity of non-minimal…