Related papers: Simple geodesics and Markoff quads
Charles, Goren, and Lauter [J. Cryptology 22(1), 2009] explained how one can construct hash functions using expander graphs in which it is hard to find paths between specified vertices. The set of solutions to the classical Markoff equation…
We find all irreducible hypergeometric sheaves whose geometric monodromy group is finite, almost quasisimple and has the projective special linear group $PSL_n(q)$ with $n\geq 3$ as a composition factor. We use the classification of…
Varieties of minimal degree and del Pezzo varieties are basic objects in projective algebraic geometry. Those varieties have been characterized and classified for a long time in many aspects. Motivated by the question "which varieties are…
Gaussian fields (GFs) are frequently used in spatial statistics for their versatility. The associated computational cost can be a bottleneck, especially in realistic applications. It has been shown that computational efficiency can be…
Consider a graph with n nodes and m edges, independent edge weights and lengths, and arbitrary distance demands for node pairs. The spanner problem asks for a minimum-weight subgraph that satisfies these demands via sufficiently short paths…
The present paper studies the structure of characteristic varieties of fundamental groups of graph manifolds. As a consequence, a simple proof of Papadima's question is provided on the characterization of algebraic links that have…
We explicitly construct simple, piecewise minimizing geodesic, arbitrarily fine interpolation of simple and Jordan curves on a Riemannian manifold. In particular, a finite sequence of partition points can be specified in advance to be…
Let $\mathcal{M}$ be a Type $\mathcal{A}$ affine surface. We show that $\mathcal{M}$ is linearly strongly projectively flat. We use the quasi-Einstein equation together with the condition that $\mathcal{M}$ is strongly projectively flat to…
The notions of bounded expansion and nowhere denseness not only offer robust and general definitions of uniform sparseness of graphs, they also describe the tractability boundary for several important algorithmic questions. In this paper we…
We consider several algorithmic problems concerning geodesics in finitely generated groups. We show that the three geodesic problems considered by Miasnikov et al [arXiv:0807.1032] are polynomial-time reducible to each other. We study two…
This survey paper concerns mainly with some asymptotic topological properties of finitely presented discrete groups: quasi-simple filtration (QSF), geometric simple connectivity (GSC), topological inverse-representations, and the notion of…
It is well-known that every isosceles tetrahedron (disphenoid) admits infinitely many simple closed geodesics on its surface. They can be naturally enumerated by pairs of co-prime integers $n > m > 1$ with two additional cases $(1,0)$ and…
In this paper we study 1/k-geodesics, those closed geodesics that minimize on any subinterval of length $l(\gamma)/k$. We employ energy methods to provide a relationship between the 1/k-geodesics and what we define as the balanced points of…
In the longest plane spanning tree problem, we are given a finite planar point set $\mathcal{P}$, and our task is to find a plane (i.e., noncrossing) spanning tree for $\mathcal{P}$ with maximum total Euclidean edge length. Despite more…
The paper consists of two parts. In the first one we show that a relatively hyperbolic group $G$ splits as a star graph of groups whose central vertex group is finitely generated and the other vertex groups are maximal parabolic subgroups.…
Let $C$ be a smooth, projective and geometrically connected curve defined over a finite field $\mathbb{F}_q(C)$. Given a semisimple $C-S$-group scheme $\underline{G}$ where $S$ is a finite set of closed points of $C$, we describe the set of…
We define the strong shortcut property for rough geodesic metric spaces, generalizing the notion of strongly shortcut graphs. We show that the strong shortcut property is a rough similarity invariant. We give several new characterizations…
We consider geodesic nets (critical points of a length functional on the space of embedded graphs) on doubled polygons (topological 2-spheres endowed with a flat metric away from finitely many cone singularities). We use the theorem of…
Many applications of geometry modeling and computer graphics necessite accurate curvature estimations of curves on the plane or on manifolds. In this paper, we define the notion of the discrete geodesic curvature of a geodesic polygon on a…
We demonstrate that the complex plane and a class of generalized Grushin planes $G_r$, where $r$ is a function satisfying specific requirements, are quasisymmetrically equivalent. Then using conjugation we are able to develop an analytic…