Related papers: Super efficiency of efficient geodesics in the com…

Let $W/K$ be a nonempty scheme over the field of fractions of a Henselian local ring $R$. A result of Gabber, Liu and Lorenzini shows that the GCD of the set of degrees of closed points on $W$ (which is called the index of $W/K$) can be…

We give a Morse-theoretic characterization of simple closed geodesics on Riemannian $2$-spheres. On any Riemannian $2$-sphere endowed with a generic metric, we show there exists a simple closed geodesic with Morse index $1$, $2$ and $3$. In…

In this work, we provide some novel results that establish both the existence of Henig global proper efficient points and their density in the efficient set for vector optimization problems in arbitrary normed spaces. Our results do not…

Consider the smooth projective models C of curves y^2=f(x) with f(x) in Z[x] monic and separable of degree 2g+1. We prove that for g >= 3, a positive fraction of these have only one rational point, the point at infinity. We prove a lower…

Spherical $t$-designs on $\mathbb{S}^{d}\subset\mathbb{R}^{d+1}$ provide $N$ nodes for an equal weight numerical integration rule which is exact for all spherical polynomials of degree at most $t$. This paper considers the generation of…

We present an algorithm that, for every fixed genus $g$, will enumerate all hyperelliptic curves of genus $g$ over a finite field $k$ of odd characteristic in quasilinear time; that is, the time required for the algorithm is…

We investigate the concept of projective equivalence of connections in supergeometry. To this aim, we propose a definition for (super) geodesics on a supermanifold in which, as in the classical case, they are the projections of the integral…

We prove that the separated curve complex of a closed orientable surface of genus g is (g-3)-connected. We also obtain a connectivity property for a separated curve complex of the open surface that is obtained by removing a finite set from…

A graph with vertex set V and edge set E is called a (d,c)-expander if the maximum degree of a vertex is d and, for every subset W of V that has cardinality at most |V|/2, the number of edges between vertices in W and vertices outside of W…

We study the topology of admissible-loop spaces on a step-two Carnot group G. We use a Morse-Bott theory argument to study the structure and the number of geodesics on G connecting the origin with a 'vertical' point (geodesics are critical…

Pairwise comparison of graphs is key to many applications in Machine learning ranging from clustering, kernel-based classification/regression and more recently supervised graph prediction. Distances between graphs usually rely on…

Let $\Sigma$ be a compact, orientable surface of negative Euler characteristic, and let $h$ be a complete hyperbolic metric on $\Sigma$. A geodesic curve $\gamma$ in $\Sigma$ is filling, if it cuts the surface into topological disks and…

Hypergraphs, which use hyperedges to capture groupwise interactions among different entities, have gained increasing attention recently for their versatility in effectively modeling real-world networks. In this paper, we study the problem…

The maximum genus $\gamma_M(G)$ of a graph G is the largest genus of an orientable surface into which G has a cellular embedding. Combinatorially, it coincides with the maximum number of disjoint pairs of adjacent edges of G whose removal…

This note is devoted to a trick which yields almost trivial proofs that certain complexes associated to topological surfaces are connected or simply connected. Applications include new proofs that the complexes of curves, separating curves,…

In this work we study the general system of geodesic equations for the case of a massive particle moving on an arbitrary curved manifold. The investigation is carried out from the symmetry perspective. By exploiting the parametrization…

A vertex set $S$ of a graph $G$ is geodetic if every vertex of $G$ lies on a shortest path between two vertices in $S$. Given a graph $G$ and $k \in \mathbb N$, the NP-hard Geodetic Set problem asks whether there is a geodetic set of size…

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 upper bound for the number of points on the curve. We present algorithms for constructing curves of genus 5,…

We prove a new, efficient version of the hypergraph container theorems that is suited for hypergraphs with large uniformities. The main novelty is a refined approach to constructing containers that employs simple ideas from high-dimensional…

The symmetrized bidisc \[ G \stackrel{\rm{def}}{=}\{(z+w,zw):|z|<1,\ |w|<1\} \] has interesting geometric properties. While it has a plentiful supply of complex geodesics and of automorphisms, there is nevertheless a unique complex geodesic…