Related papers: On curves intersecting at most once

We define winding numbers of regular closed curves on surfaces with a nice euclidean or hyperbolic geometry. We prove that two regular closed curves are regularly homotopic if and only if they are freely homotopic and have the same winding…

We study the chromatic number of the curve graph of a surface. We show that the chromatic number grows like k log k for the graph of separating curves on a surface of Euler characteristic -k. We also show that the graph of curves that…

The closure of a graph $G$ is the graph $G^*$ obtained from $G$ by repeatedly adding edges between pairs of non-adjacent vertices whose degree sum is at least $n$, where $n$ is the number of vertices of $G$. The well-known Closure Lemma…

Suppose that $G$ is a graph of cardinality $\mu^+$ with chromatic number $\chi(G)\geq \mu^+$. One possible reason that this could happen is if $G$ contains a clique of size $\mu^+$. We prove that this is indeed the case when the edge…

We initiate the study of computing shortest non-separating simple closed curves with some given topological properties on non-orientable surfaces. While, for orientable surfaces, any two non-separating simple closed curves are related by a…

The subject of limit curve theorems in Lorentzian geometry is reviewed. A general limit curve theorem is formulated which includes the case of converging curves with endpoints and the case in which the limit points assigned since the…

We give examples of sequences of smooth non-isotrivial curves for every genus at least two, defined over a rational function field of positive characteristic, such that the (finite) number of rational points of the curves in the sequence…

Let k be a finite field of odd characteristic. We find a closed formula for the number of k-isomorphism classes of pointed, and non-pointed, hyperelliptic curves of genus g over k, admitting a Koblitz model. These numbers are expressed as a…

We show that the complex of homologous curves of a closed, oriented surface of genus g is (g-3)--acyclic.

We supply an upper bound on the distinguishing chromatic number of certain infinite graphs satisfying an adjacency property. Distinguishing proper $n$-colourings are generalized to the new notion of distinguishing homomorphisms. We prove…

A singular curve over a non-perfect field K may not have a smooth model over K. Those are said to "change genus". If K is a global field of positive characteristic and C/K a curve that change genus, then C(K) is known to be finite. The…

We show that up to isomorphism there are exactly twenty pairs $(C,E)$, where $C$ is a genus-$2$ curve over ${\mathbf C}$, where $E$ is an elliptic curve over ${\mathbf C}$, and where for every integer $n>1$ there is a map of degree $n$ from…

Let $(X,L)$ be a polarized K3 surface of genus $g$ and $C_{en} \subset X$ be the curve of singular points of nodal elliptic curves in $|L|$. When $(X,L)$ is generic of genus two, Huybrechts observed that the curve $C_{en}$ is a constant…

The n-th crossing number of a graph G, denoted cr_n(G), is the minimum number of crossings in a drawing of G on an orientable surface of genus n. We prove that for every a>b>0, there exists a graph G for which cr_0(G) = a, cr_1(G) = b, and…

We investigate the geometry of holomorphic curves and complex surfaces from the perspective of singularity theory. We show that, with a suitable choice of a complex bilinear symmetric form, the families of functions and mappings that…

It is known that for a smooth hyperelliptic curve to have a large $a$-number, the genus must be small relative to the characteristic of the field, $p>0$, over which the curve is defined. It was proven by Elkin that for a genus $g$…

We are interested in the algebraic intersection of closed curves of a given length on translation surfaces. Namely, we study the quantity KVol which measures how many times can two closed curves of a given length intersect. In this paper,…

We say a graph has property $\mathcal{P}_{g,p}$ when it is an induced subgraph of the curve graph of a surface of genus $g$ with $p$ punctures. Two well-known graph invariants, the chromatic and clique numbers, can provide obstructions to…

For a graph G, let h(G) denote the largest k such that G has k pairwise disjoint pairwise adjacent connected nonempty subgraphs, and let s(G) denote the largest k such that G has k pairwise disjoint pairwise adjacent connected subgraphs of…

The genus of a maximal curve over a finite field with r^2 elements is either g_0=r(r-1)/2 or less than or equal to g_1=(r-1)^2/4. Maximal curves with genus g_0 or g_1 have been characterized up to isomorphism. A natural genus to be studied…