Related papers: Super efficiency of efficient geodesics in the com…
We introduce the \textit{modular intersection kernel}, and we use it to study how geodesics intersect on the full modular surface $\mathbb{X}=PSL_2\left(\mathbb{Z}\right) \backslash \mathbb{H}$. Let $C_d$ be the union of closed geodesics…
A graph $G$ is said to be super edge-magic if there exists a bijective function $f:V\left(G\right) \cup E\left(G\right)\rightarrow \left\{1, 2, \ldots , \left\vert V\left( G\right) \right\vert +\left\vert E\left( G\right) \right\vert…
Algorithms for the computation of geodesics on an ellipsoid of revolution are given. These provide accurate, robust, and fast solutions to the direct and inverse geodesic problems and they allow differential and integral properties of…
This paper introduces a fast Central Processing Unit (CPU) implementation of geodesic morphological operations using stream processing. In contrast to the current state-of-the-art, that focuses on achieving insensitivity to the filter sizes…
We prove that on a closed surface of genus $g$, the cardinality of a set of simple closed curves in which any two are non-homotopic and intersect at most once is $\lesssim g^2 \log(g)$. This bound matches the largest known constructions to…
We describe a new algorithm to compute the geometric intersection number between two curves, given as edge vectors on an ideal triangulation. Most importantly, this algorithm runs in polynomial time in the bit-size of the two edge vectors.…
A graph $G$ is geodetic if between any two vertices there exists a unique shortest path. In 1962 Ore raised the challenge to characterize geodetic graphs, but despite many attempts, such characterization still seems well beyond reach. We…
In this note we establish estimates for the harmonic map heat flow from $S^1$ into a closed manifold, and use it to construct sweepouts with the following good property: each curve in the tightened sweepout, whose energy is close to the…
We show that every smooth closed curve C immersed in Euclidean 3-space satisfies the sharp inequality 2(P+I)+V >5 which relates the numbers P of pairs of parallel tangent lines, I of inflections (or points of vanishing curvature), and V of…
A geometric $t$-spanner for a set $S$ of $n$ point sites is an edge-weighted graph for which the (weighted) distance between any two sites $p,q \in S$ is at most $t$ times the original distance between $p$ and~$q$. We study geometric…
This paper is about a type of quantitative density of closed geodesics and orthogeodesics on complete finite-area hyperbolic surfaces. The main results are upper bounds on the length of the shortest closed geodesic and the shortest doubly…
The Hasse-Weil-Serre bound is improved for curves of low genera over finite fields with discriminant in {-3,-4,-7,-8,-11,-19} by studying optimal curves.
Geodesic convexity generalizes the notion of (vector space) convexity to nonlinear metric spaces. But unlike convex optimization, geodesically convex (g-convex) optimization is much less developed. In this paper we contribute to the…
Given a hyperbolic surface $\Sigma$ of genus $g$ with $r$ cusps, Mirzakhani proved that the number of closed geodesics of length at most $L$ and of a given type is asymptotic to $cL^{6g-6+2r}$ for some $c>0$. Since a closed geodesic…
Given a graph $G$, the strong clique number of $G$, denoted $\omega_S(G)$, is the maximum size of a set $S$ of edges such that every pair of edges in $S$ has distance at most $2$ in the line graph of $G$. As a relaxation of the renowned…
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…
The geometry of closed surfaces equipped with a Euclidean metric with finitely many conical points of arbitrary angle is studied. The main result is that the set of closed geodesics is dense in the space of geodesics.
We determine necessary conditions for ample divisors in arbitrary genus as well as for very ample divisors in genus 2 and 3. We also compute the intersection numbers $\lambda^9$ and $\lambda_{g-1}^3$ in genus 4. The latter number is…
Pairwise comparison matrices and the weight vectors obtained from them are important concepts in multi-criteria decision making. A weight vector calculated from a pairwise comparison matrix is called Pareto efficient if the approximation of…
This work considers the problem of computing distances between structured objects such as undirected graphs, seen as probability distributions in a specific metric space. We consider a new transportation distance (i.e. that minimizes a…