Related papers: Crossing number of curves on surfaces
The {\it crossing number} of a graph $G$ is the minimum number of pairwise intersections of edges in a drawing of $G$. In this paper, we give the exact values of crossing numbers for some variations of hypercube with order at most four,…
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.
Given a surface S in P^3 and a collection of general points on it, how many surfaces of a given degree intersect S in a curve with prescribed multiplicities at the points? We formulate two natural conjectures which would answer this…
We obtain a coarse relationship between geometric intersection numbers of curves and the sum of their subsurface projection distances with explicit quasi-constants. By using this relationship, we give applications in the studies of the…
We show that the maximal number of singular moves required to pass between any two regularly homotopic planar or spherical curves with at most n crossings, grows quadratically with respect to n. Furthermore, this can be done with all curves…
We use class field theory to search for curves with many rational points over small finite fields. By going through abelian covers of curves of small genus we find a number of new curves. In particular, we settle the question of how many…
A fast algorithm for counting intersections of two normal curves on a triangulated surface is proposed. It yields a convenient way for treating mapping class groups of punctured surfaces by presenting mapping classes by matrices, and the…
This paper proves an elementary topological fact about closed curves on surfaces, namely that by carefully smoothing an intersection point, one can reduce self-intersection by exactly $1$. This immediately implies a positive answer to a…
We present a practical algorithm to determine the minimal genus of non-orientable spanning surfaces for 2-bridge knots, called the crosscap numbers. We will exhibit a table of crosscap numbers of 2-bridge knots up to 12crossings (all 362 of…
We study filling sets of simple closed curves on punctured surfaces. In particular we study lower bounds on the cardinality of sets of curves that fill and that pairwise intersect at most k times on surfaces with given genus and number of…
For an oriented surface $S$, the singular set of a fold map $f:S\rightarrow \mathbb{R}^2$ is a collection of smooth curves, also known as fold singularities. We construct a sharp lower bound on the number of self-intersections of such fold…
Any finite configuration of curves with minimal intersections on a surface is a configuration of shortest geodesics for some Riemannian metric on the surface. The metric can be chosen to make the lengths of these geodesics equal to the…
One of the big questions in the area of curves over finite fields concerns the distribution of the numbers of points: Which numbers occur as the number of points on a curve of genus $g$? The same question can be asked of various subclasses…
In this paper we obtain an explicit formula for the number of curves in a compact complex surface $X$ (passing through the right number of generic points), that has up to one node and one singularity of codimension $k$, provided the total…
If two closed Jordan curves in the plane have precisely one point in common, then it is called a {\em touching point}. All other intersection points are called {\em crossing points}. The main result of this paper is a Crossing Lemma for…
We study intersections of exceptional curves on del Pezzo surfaces of degree 1, motivated by questions in arithmetic geometry. Outside characteristics 2 and 3, at most 10 exceptional curves can intersect in a point. We classify the…
The crossing number of a graph is the minimum number of edge crossings that a graph can have when drawn in the plane. Determining this number, known as the Crossing Number problem, is a celebrated problem in combinatorial optimization. It…
Given a surface with boundary and some points on its boundary, a polygon diagram is a way to connect those points as vertices of non-overlapping polygons on the surface. Such polygon diagrams represent non-crossing permutations on a surface…
The mapping class group of a surface $\S$ acts on the set of closed geodesics on $\S$. This action preserves self-intersection number. In this paper, we count the orbits of curves with at most $K$ self-intersections, for each $K \geq 1$.…
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,…