Related papers: Geometric intersections of loops on surfaces
We give a recipe to compute the geometric intersection number of an integral lamination with a particular type of integral lamination on an n-times punctured disk. This provides a way to find the geometric intersection number of two…
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 introduce an operation that measures the self intersections of paths on a surface. As applications, we give a criterion of the realizability of a generalized Dehn twist, and derive a geometric constraint on the image of the Johnson…
We find the minimal number of self-intersections of the boundary of a surface of genus g generically immersed in the plane.
We give an explicit formula for the self-intersection number of negative curves on Fermat surfaces. The formula offers us hints to either prove or disprove the Bounded Negativity Conjecture for the Fermat surfaces.
For two oriented simple closed curves on a compact orientable surface with a connected boundary we introduce a simple computation of a value in the first homology group of the surface, which detects in some cases that the geometric…
The need to compute the intersections between a line and a high-order curve or surface arises in a large number of finite element applications. Such intersection problems are easy to formulate but hard to solve robustly. We introduce a…
We show that the detection of geometric intersection in an arbitrary representation of the mapping class group of surface implies the injectivity of that representation up to center, and vice versa. As an application, we discuss the…
Oriented loops on an orientable surface are, up to equivalence by free homotopy, in one-to-one correspondence with the conjugacy classes of the surface's fundamental group. These conjugacy classes can be expressed (not uniquely in the case…
We propose an algorithm based on Newton's method and subdivision for finding all zeros of a polynomial system in a bounded region of the plane. This algorithm can be used to find the intersections between a line and a surface, which has…
The problem on the minimal number (with respect to deformation) of intersection points of two closed curves on a surface is solved. Following the Nielsen approach, we define classes of intersection points and essential classes of…
Our main point of focus is the set of closed geodesics on hyperbolic surfaces. For any fixed integer $k$, we are interested in the set of all closed geodesics with at least $k$ (but possibly more) self-intersections. Among these, we…
A complete treatment of the intersections of two geodesics on the surface of an ellipsoid of revolution is given. With a suitable metric for the distances between intersections, bounds are placed on their spacing. This leads to fast and…
Given a compact orientable surface $\Sigma$, let $\Cal S(\Sigma)$ be the set of isotopy classes of essential simple loops on $\Sigma$. We determine a complete set of relations for a function from $\Cal S(\Sigma)$ to $\bold Z$ to be a…
In an orientable surface with boundary, free homotopy classes of curves on surfaces are in one to one correspondence with cyclic reduced words in a set of standard generators of the fundamental group. The combinatorial length of a class is…
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…
This paper explores the relationship between closed curves on surfaces and their intersections. Like Dehn-Thurston coordinates for simple curves, we explore how to determine closed curves using the number of times they intersect other…
We outline a strategy for computing intersection numbers on smooth varieties with torus actions using a residue formula of Bott. As an example, Gromov-Witten numbers of twisted cubic and elliptic quartic curves on some general complete…
The intersection numbers of p-spin curves are computed through correlation functions of Gaussian ensembles of random matrices in an external matrix source. The p-dependence of intersection numbers is determined as polynomial in p; the large…
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…