Related papers: Making Multicurves Cross Minimally on Surfaces

In the last decade, the concept of path signature has achieved significant success in data science applications. It offers a powerful set of features that effectively capture and describe the characteristics of paths or sequential data.…

Let $\gamma_0$ be a curve on a surface $\Sigma$ of genus $g$ and with $r$ boundary components and let $\pi_1(\Sigma)\curvearrowright X$ be a discrete and cocompact action on some metric space. We study the asymptotic behavior of the number…

Dumas, Foucaud, Perez, and Todinca [SIAM J. Disc. Math., 2024] proved that if the vertex set of a graph $G$ can be covered by $k$ shortest paths, then the pathwidth of $G$ is bounded by $\mathcal{O}(k \cdot 3^k)$. We prove a coarse variant…

We prove that every locally Hamiltonian graph with $n\ge 3$ vertices and possibly with multiple edges has at least $3n-6$ edges with equality if and only if it triangulates the sphere. As a consequence, every edge-maximal embedding of a…

For a graph $\Gamma$, the {\em distance} $d_\Gamma(u,v)$ between two distinct vertices $u$ and $v$ in $\Gamma$ is defined as the length of the shortest path from $u$ to $v$, and the {\em diameter} $\mathrm{diam}(\Gamma)$ of $\Gamma$ is the…

Let $S_{g,p}$ denote the genus $g$ orientable surface with $p \ge 0$ punctures, and let $\omega(g,p)= 3g+p-4$. We prove the existence of infinitely long geodesic rays $\left\{v_{0},v_{1}, v_{2}, ...\right\}$ in the curve graph satisfying…

We exhibit a polynomial time computable plane curve GAMMA that has finite length, does not intersect itself, and is smooth except at one endpoint, but has the following property. For every computable parametrization f of GAMMA and every…

The Subgraph Isomorphism problem asks, given a host graph G on n vertices and a pattern graph P on k vertices, whether G contains a subgraph isomorphic to P. The restriction of this problem to planar graphs has often been considered. After…

In this work, we prove the existence of a third embedded minimal hypersurface spanning a closed submanifold $\gamma$ contained in the boundary of a compact Riemannian manifold with convex boundary, when it is known a priori the existence of…

An $H$-decomposition of a graph $\Gamma$ is a partition of its edge set into subgraphs isomorphic to $H$. A transitive decomposition is a special kind of $H$-decomposition that is highly symmetrical in the sense that the subgraphs (copies…

Let $Y$ be a hyperbolic surface and let $\phi$ be a Laplacian eigenfunction having eigenvalue $-1/4-\tau^2$ with $\tau>0$. Let $N(\phi)$ be the set of nodal lines of $\phi$. For a fixed analytic curve $\gamma$ of finite length, we study the…

We prove that any weakly acausal curve $\Gamma$ in the boundary of Anti-de Sitter (2+1)-space is the asymptotic boundary of two spacelike $K$-surfaces, one of which is past-convex and the other future-convex, for every $K\in(-\infty,-1)$.…

Motivated by the increasing need to understand the distributed algorithmic foundations of large-scale graph computations, we study some fundamental graph problems in a message-passing model for distributed computing where $k \geq 2$…

Real-world graphs often manifest as a massive temporal stream of edges. The need for real-time analysis of such large graph streams has led to progress on low memory, one-pass streaming graph algorithms. These algorithms were designed for…

In this paper, we develop a method to compute the Morse homology of a manifold when descending manifolds and ascending manifolds intersect cleanly, but not necessarily transversely. While obstruction bundle gluing defined by Hutchings and…

The intersection graph of a collection of trapezoids with corner points lying on two parallel lines is called a trapezoid graph. Using binary indexed tree data structure, we improve algorithms for calculating the size and the number of…

Let $G/H$ be a homogeneous space of reductive type with non-compact $H$. The study of deformations of discontinuous groups for $G/H$ was initiated by T.~Kobayashi. In this paper, we show that a standard discontinuous group $\Gamma$ admits a…

Curves play a fundamental role across computer graphics, physical simulation, and mathematical visualization, yet most tools for curve design do nothing to prevent crossings or self-intersections. This paper develops efficient algorithms…

A retract of a graph $\Gamma$ is an induced subgraph $\Psi$ of $\Gamma$ such that there exists a homomorphism from $\Gamma$ to $\Psi$ whose restriction to $\Psi$ is the identity map. A graph is a core if it has no nontrivial retracts. In…

The degree of a map between orientable manifolds is a fundamental concept in topology, offering deep insights into the structure of the manifolds and the nature of the corresponding maps. This concept has been extensively studied,…