Related papers: Making Multicurves Cross Minimally on Surfaces
The geometric intersection number of a curve on a surface is the minimal number of self-intersections of any homotopic curve, i.e. of any curve obtained by continuous deformation. Given a curve $c$ represented by a closed walk of length at…
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…
The main goal of this paper is to investigate the minimal size of families of curves on surfaces with the following property: a family of simple closed curves $\Gamma$ on a surface realizes all types of pants decompositions if for any pants…
We prove the first polynomial bound on the number of monotonic homotopy moves required to tighten a collection of closed curves on any compact orientable surface, where the number of crossings in the curve is not allowed to increase at any…
We prove that, if a closed geodesic $\Gamma$ on a complete finite type hyperbolic surface has at least 2 self-intersections, then the length of $\Gamma$ has an lower bound $2\log(5+2\sqrt6)$, and the lower bound is sharp, attained on a…
The geometry of a graph $G$ embedded on a closed oriented surface $S$ can be probed by counting the intersections of $G$ with closed curves on $S$. Of special interest is the map $c \mapsto \mu_G(c)$ counting the minimum number of…
We consider systems of simple closed curves on surfaces and their total number of intersection points, their so-called crossing number. For a fixed number of curves, we aim to minimise the crossing number. We determine the minimal crossing…
Given a compact surface $\Gamma$ embedded in $\mathbb R^3$ with boundary $\partial \Gamma$, our goal is to construct a set of representatives for a basis of the relative cohomology group $H^1(\Gamma, \partial \Gamma^c)$, where $\Gamma^c$ is…
How much cutting is needed to simplify the topology of a surface? We provide bounds for several instances of this question, for the minimum length of topologically non-trivial closed curves, pants decompositions, and cut graphs with a given…
We study mapping class group orbits of homotopy and isotopy classes of curves with self-intersections. We exhibit the asymptotics of the number of such orbits of curves with a bounded number of self-intersections, as the complexity of the…
In this paper, we provide upper and lower bounds on the crossing numbers of dense graphs on surfaces, which match up to constant factors. First, we prove that if $G$ is a dense enough graph with $m$ edges and $\Sigma$ is a surface of genus…
Suppose $S$ is a closed, oriented surface of genus at least two. This paper investigates the geometry of the homology multicurve complex, $\mathcal{HC}(S,\alpha)$, of $S$; a complex closely related to complexes studied by…
We describe some theoretical results on triangulations of surfaces and we develop a theory on roots, decompositions and genus-surfaces. We apply this theory to describe an algorithm to list all triangulations of closed surfaces with at most…
A sequence of constant mean curvature surfaces $\Sigma_j$ with mean curvature $H_j \to \infty$ in a three-dimensional manifold $M$ condenses to a compact and connected graph $\Gamma$ consisting of a finite union of curves if $\Sigma_j$ is…
Consider a graph drawn on a surface (for example, the plane minus a finite set of obstacle points), possibly with crossings. We provide an algorithm to decide whether such a drawing can be untangled, namely, if one can slide the vertices…
In this article, we investigate short topological decompositions of non-orientable surfaces and provide algorithms to compute them. Our main result is a polynomial-time algorithm that for any graph embedded in a non-orientable surface…
Consider a fixed connected, finite graph $\Gamma$ and equip its vertices with weights $p_i$ which are non-negative integers. We show that there is a finite number of possibilities for the coefficients of the canonical cycle of a numerically…
A planar orthogonal drawing {\Gamma} of a connected planar graph G is a geometric representation of G such that the vertices are drawn as distinct points of the plane, the edges are drawn as chains of horizontal and vertical segments, and…
The intersection ideal graph $\Gamma(S)$ of a semigroup $S$ is a simple undirected graph whose vertices are all nontrivial left ideals of $S$ and two distinct left ideals $I, J$ are adjacent if and only if their intersection is nontrivial.…
Let $\Gamma$ be an arrangement of Jordan curves in the plane, i.e., simple closed curves in the plane. For any curve $\gamma \in \Gamma$, we denote the bounded region enclosed by $\gamma$ as $\tilde{\gamma}$. We say that $\Gamma$ is…