Related papers: Super efficiency of efficient geodesics in the com…
We prove a quantitative estimate, with a power saving error term, for the number of simple closed geodesics of length at most $L$ on a compact surface equipped with a Riemannian metric of negative curvature. The proof relies on the…
In a previous joint article with F. Abu Salem, we gave efficient algorithms for Jacobian group arithmetic of "typical" divisor classes on C_{3,4} curves, improving on similar results by other authors. At that time, we could only state that…
The maximum number of vertices in a graph of maximum degree $\Delta\ge 3$ and fixed diameter $k\ge 2$ is upper bounded by $(1+o(1))(\Delta-1)^{k}$. If we restrict our graphs to certain classes, better upper bounds are known. For instance,…
The mapping class group of a surface $\S$ acts on the set of closed geodesics on $\S$. This action preserves self-intersection number. In this paper, we count the orbits of curves with at most $K$ self-intersections, for each $K \geq 1$.…
Let $M$ be a simply connected Riemannian manifold in $\mathscr{M}_{k,v}^D(n)$, the space of closed Riemannian manifolds of dimension $n$ with sectional curvature bounded below by $k$, volume bounded below by $v$, and diameter bounded above…
A projective, smooth, absolutely irreducible algebraic curve X of genus g defined over a finite field F_q is called optimal if for every other such genus g curve Y over F_q one has $\#Y(F_q)\le \#X(F_q)$. In this paper we show that for…
Given a connected graph $G$, a vertex $w\in V(G)$ distinguishes two different vertices $u,v$ of $G$ if the distances between $w$ and $u$ and between $w$ and $v$ are different. Moreover, $w$ strongly resolves the pair $u,v$ if there exists…
For a family $\mathcal{C}$ of properly embedded curves in the 2-dimensional disk $\mathbb{D}^{2}$ satisfying certain uniqueness properties, we consider convex polygons $P\subset \mathbb{D}^{2}$ and define a metric $d$ on $P$ such that…
The Fr\'echet distance is a popular similarity measure that is well-understood for polygonal curves in $\mathbb{R}^d$: near-quadratic time algorithms exist, and conditional lower bounds suggest that these results cannot be improved…
Deciding realizability of a given polyhedral map on a (compact, connected) surface belongs to the hard problems in discrete geometry, from the theoretical, the algorithmic, and the practical point of view. In this paper, we present a…
Geodesic distance, commonly called shortest path length, has proved useful in a great variety of disciplines. It has been playing a significant role in search engine at present and so attracted considerable attention at the last few…
We investigate local and global properties of timelike geodesics in three static spherically symmetric spacetimes. These properties are of its own mathematical relevance and provide a solution of the physical `twin paradox' problem. The…
Elliptic curves have a well-known and explicit theory for the construction and application of endomorphisms, which can be applied to improve performance in scalar multiplication. Recent work has extended these techniques to hyperelliptic…
We give new arguments that improve the known upper bounds on the maximal number N_q(g) of rational points of a curve of genus g over a finite field F_q for a number of pairs (q,g). Given a pair (q,g) and an integer N, we determine the…
In this paper we consider the question of determining the geometric genera of irreducible curves lying on a very general surface $S$ of degree $d$ at least 5 in $\mathbb{P}^3$ (the cases $d \leqslant 4$ are well known). We introduce the set…
Consider all geodesics between two given points on a polyhedron. On the regular tetrahedron, we describe all the geodesics from a vertex to a point, which could be another vertex. Using the Stern--Brocot tree to explore the recursive…
We derive various inequalities involving the intersection number of the curves contained in geodesics and tight geodesics in the curve graph. While there already exist such inequalities on tight geodesics, our method applies in the setting…
Let $C$ be a complex irreducible plane curve that is not the vanishing locus of a modular polynomial. We show that $C$ contains finitely many real algebraic curves whose projection on each coordinate axis is a union of special geodesics.
We study the query complexity of geodesically convex (g-convex) optimization on a manifold. To isolate the effect of that manifold's curvature, we primarily focus on hyperbolic spaces. In a variety of settings (smooth or not; strongly…
All parallel algorithms for directed reachability and shortest paths crucially rely on efficient shortcut constructions. These constructions find directed paths and shortcut them by adding edges, with the goal to reduce the diameter of the…