Related papers: Super efficiency of efficient geodesics in the com…
Faltings' theorem states that curves of genus $g \geq 2$ have finitely many rational points. Using the ideas of Faltings, Mumford, Parshin and Raynaud, one obtains an upper bound on the number of rational points, but this bound is too large…
Let $N$ be a compact, connected, nonorientable surface of genus $g$ with $n$ boundary components. Let $\mathcal{C}(N)$ be the curve complex of $N$. We prove that if $(g, n) \neq (1,2)$ and $g + n \neq 4$, then there is an exhaustion of…
By "geodesic" we mean any sequence of vertices $(v_1,v_2,...,v_k)$ of a graph $G$ that constitute a shortest path from $v_1$ to $v_k$. We propose a novel, natural algorithm to enumerate all geodesics of $G$, and pit it (using Mathematica)…
We study properties of typical closed geodesics on expander surfaces of high genus, i.e. closed hyperbolic surfaces with a uniform spectral gap of the Laplacian. Under an additional systole lower bound assumption, we show almost every…
Solving the so-called geodesic endpoint problem, i.e., finding a geodesic that connects two given points on a manifold, is at the basis of virtually all data processing operations, including averaging, clustering, interpolation and…
The "defect" of a curve over a finite field is the difference between the number of rational points on the curve and the Weil-Serre bound for the curve. We present a construction for producing genus-4 double covers of genus-2 curves over…
We find a sharp bound for the order of the automorphism group of a stable curve of genus $g$ with $3g-3$ nodes, and a sharp bound for the order of the automorphism group of such a curve with all smooth components. Combined with the results…
We show that the number of simple closed geodesics of length bounded by L on a hyperbolic surface of genus g with c cusps and b boundary components grows roughly like L^{6g+2b+2c-6}. This has been conjectured for some time.
The strong geodetic number, $\text{sg}(G),$ of a graph $G$ is the smallest number of vertices such that by fixing one geodesic between each pair of selected vertices, all vertices of the graph are covered. In this paper, the study of the…
A curve X over the field Q of rational numbers is modular if it is dominated by X_1(N) for some N; if in addition the image of its jacobian in J_1(N) is contained in the new subvariety of J_1(N), then X is called a new modular curve. We…
Given a Riemannian metric on the 2-sphere, sweep the 2-sphere out by a continuous one-parameter family of closed curves starting and ending at point curves. Pull the sweepout tight by, in a continuous way, pulling each curve as tight as…
Given a graph $G$, a geodesic packing in $G$ is a set of vertex-disjoint maximal geodesics, and the geodesic packing number of $G$, ${\gpack}(G)$, is the maximum cardinality of a geodesic packing in $G$. It is proved that the decision…
A classical inequality which is due to Lickorish and Hempel says that the distance between two curves in the curve complex can be measured by their intersection number. In this paper, we show a converse version; the intersection number of…
For each odd $n \geq 3$, we construct a closed convex hypersurface of $\mathbb{R}^{n+1}$ that contains a non-degenerate closed geodesic with Morse index zero. A classical theorem of J. L. Synge would forbid such constructions for even $n$,…
The strong geodetic problem is a recent variation of the classical geodetic problem. For a graph $G$, its strong geodetic number ${\rm sg}(G)$ is the cardinality of a smallest vertex subset $S$, such that each vertex of $G$ lies on one…
We present some algorithms that provide useful topological information about curves in surfaces. One of the main algorithms computes the geometric intersection number of two properly embedded 1-manifolds $C_1$ and $C_2$ in a compact…
We prove an equidistribution result for totally geodesic submanifolds in a compact locally symmetric space. In the case of Hermitian locally symmetric spaces, this gives a convergence theorem for currents of integration along totally…
Given a graph $G$, a subset $S$ of vertices of $G$ is an efficient dominating set ($EDS$) if $|N[v] \cap S|=1,$ for all $v\in V(G)$. A graph $G$ is efficiently dominatable if it possesses an $EDS$. The efficient domination number of G is…
We study configurations of immersed curves in surfaces and surfaces in 3-manifolds. Among other results, we show that primitive curves have only finitely many configurations which minimize the number of double points. We give examples of…
In this work, we propose to study the global geometrical properties of generative models. We introduce a new Riemannian metric to assess the similarity between any two data points. Importantly, our metric is agnostic to the parametrization…