Related papers: Topological Designs

We classify invariant curves for birational surface maps that are expanding on cohomology. When the expansion is exponential, the arithmetic genus of an invariant curve is at most one. This implies severe constraints on both the type and…

We study the problem of finding the minimal (maximal) genus for a surface where a given four-valent graph with fixed opposite edge structure can be embedded into. We find several partial relations and give new reformulations in…

For several embedded surfaces with zero self-intersection number in 4-manifolds, we show that an adjunction-type genus bound holds for at least one of the surfaces under certain conditions. For example, we derive certain adjunction…

We find a closed formula for the number $\operatorname{hyp}(g)$ of hyperelliptic curves of genus $g$ over a finite field $k=\mathbb{F}_q$ of odd characteristic. These numbers $\operatorname{hyp}(g)$ are expressed as a polynomial in $q$ with…

Let $S_{g}$ denote the genus $g$ closed orientable surface. For $k\in \mathbb{N}$, a $k$-system is a collection of pairwise non-homotopic simple closed curves such that no two intersect more than $k$ times. Juvan-Malni\v{c}-Mohar…

Let $M$ be an orientable 3-manifold with $\partial M$ a single torus. We show that the number of boundary slopes of immersed essential surfaces with genus at most $g$ is bounded by a quadratic function of $g$. In the hyperbolic case, this…

This article is an extended version of preprint math.AG/9902104. We find an explicit formula for the number of topologically different ramified coverings of a sphere by a genus g surface with only one complicated branching point in terms of…

We give effective upper bounds for the number of purely inseparable points on non isotrivial curves over function fields of positive characteristic and of transcendence degree one. These bounds depend on the genus of the curve, the genus of…

Let $G$ be a bipartite graph without loops and multiple edges on $v\ge 4$ vertices, which can be drawn on the plane such that any edge intersects at most one other edge. We prove that such graph has at most $3v-8$ edges for even $v\ne 6$…

Given an integer $\gamma\geq 2$ and an odd prime power $q$ we show that for every large genus $g$ there exists a non-singular curve $C$ defined over $\mathbb{F}_q$ of genus $g$ and gonality $\gamma$ and with exactly $\gamma(q+1)$…

A simple topological graph $G$ is a graph drawn in the plane so that any pair of edges have at most one point in common, which is either an endpoint or a proper crossing. $G$ is called saturated if no further edge can be added without…

Let $S_{g}$ denote the closed orientable surface of genus $g$. We construct exponentially many mapping class group orbits of pairs of simple closed curves which fill $S_{g}$ and intersect minimally, by showing that such orbits are in…

This note is devoted to a trick which yields almost trivial proofs that certain complexes associated to topological surfaces are connected or simply connected. Applications include new proofs that the complexes of curves, separating curves,…

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…

A system of simple closed curves on a surface of genus $g$ is said to be sparse if their average pairwise intersection number does not exceed one. We show that the maximal size of a sparse curve systems grows roughly like a function of type…

In this article, we construct the first example of an elliptic surface with infinitely many smooth \((-1)\)-curves of genus \(g>1\), settling an open question of Bauer et al. [Duke Math. J. \textbf{162} (10) (2013), 1877-1894].

We determine the crossing number of polynomial size curve systems on standard surfaces, in terms of the genus, up to high precision.

We show that for every g > 1 there is a compact arithmetic Riemann surface of genus g with at least 4(g-1) automorphisms, and that this lower bound is attained by infinitely many genera, the smallest being 24.

We prove that on a closed, orientable surface of genus $g$, a set of simple loops with the property that no two are homotopic or intersect in more than $k$ points has cardinality $\lesssim_k g^{k+1} \log g$. The bound matches the size of…

The bondage number b(G) of a graph G is the smallest number of edges of G whose removal from G results in a graph having the domination number larger than that of G. We show that, for a graph G having the maximum vertex degree $\Delta(G)$…