Related papers: Proportion of blocking curves in a pencil

It is known that for a curve defined over $\mathbb{Q}$ of genus $g \leq 4$, there exists a point on the curve defined over a solvable extension of $\mathbb{Q}$. We relate points on curves of genus $g \geq 5$ over solvable extensions to the…

Under the assumption that the adjusted Brill-Noether number $\widetilde{\rho}$ is at least $-g$, we prove that the Brill-Noether loci in $\mathcal{M}_{g,n}$ of pointed curves carrying pencils with prescribed ramification at the marked…

The aim of this paper is to investigate the intersection problem between two linear sets in the projective line over a finite field. In particular, we analyze the intersection between two clubs with eventually different maximum fields of…

In this article, we study subloci of solvable curves in $\mathcal{M}_g$ which are contained in either a K3-surface or a quadric or a cubic surface. We give a bound on the dimension of such subloci. In the case of complete intersection genus…

In the moduli space $\mathcal{R}_g$ of double \'etale covers of curves of a fixed genus $g$, the locus formed by covers of curves with a semicanonical pencil consists of two irreducible divisors $\mathcal T^e_g$ and $\mathcal T^o_g$. We…

The problem Level Planarity asks for a crossing-free drawing of a graph in the plane such that vertices are placed at prescribed y-coordinates (called levels) and such that every edge is realized as a y-monotone curve. In the variant…

Let S be a smooth, projective surface of Picard rank 1 and very ample generator embedding S into P^n. Let C be a smooth curve in O(m) for m \geq 5. We prove that any base-point free, complete g^r_d on C for r\in\{1,2\} and d small enough is…

Every smooth cubic plane curve has 9 inflection points, 27 sextatic points, and 72 ``points of type nine". Motivated by these classical algebro-geometric constructions, we study the following topological question: Is it possible to…

Point-set embeddings and large-angle crossings are two areas of graph drawing that independently have received a lot of attention in the past few years. In this paper, we consider problems in the intersection of these two areas. Given the…

Let $G$ be a reductive group acting on an affine scheme $V$. We study the set of principal $G$-bundles on a smooth projective curve $\mathcal C$ such that the associated $V$-bundle admits a section sending the generic point of $\mathcal C$…

The square peg problem asks whether every continuous curve in the plane that starts and ends at the same point without self-intersecting contains four distinct corners of some square. Toeplitz conjectured in 1911 that this is indeed the…

A Poisson pencil is called flat if all brackets of the pencil can be simultaneously locally brought to a constant form. Given a Poisson pencil on a 3-manifold, we study under which conditions it is flat. Since the works of Gelfand and…

One of the general problems in algebraic geometry is to determine algorithmically whether or not a given geometric object, defined by explicit polynomial equations (e.g. a curve or a surface), satisfies a given property (e.g. has…

We investigate plane curves intersecting in at most two unibranched points to study the algebraic exceptional set appearing in standard conjectures of diophantine and hyperbolic geometry. Our first result compares the local geometry of two…

In the Selective Coloring problem, we are given an integer $k$, a graph $G$, and a partition of $V(G)$ into $p$ parts, and the goal is to decide whether or not we can pick exactly one vertex of each part and obtain a $k$-colorable induced…

We show that a general curve in an explicit class of what we call Du Val pointed curves satisfies the Brill-Noether Theorem for pointed curves. Furthermore, we prove that a generic pencil of Du Val pointed curves is disjoint from all…

We consider $(1,1)$-surfaces, namely, minimal compact complex surfaces $S$ with $p_g (S) =K_S^2=1$: for these the bicanonical map is a covering of degree $4$ of the plane $\mathbb{P}^2$. And we answer a question posed by Meng Chen, whether…

The Colouring problem is that of deciding, given a graph $G$ and an integer $k$, whether $G$ admits a (proper) $k$-colouring. For all graphs $H$ up to five vertices, we classify the computational complexity of Colouring for…

Let $X$ be a smooth projective surface such that linear and numerical equivalence of divisors on $X$ coincide and let $\sigma\subseteq |D|$ be a linear pencil on $X$ with integral general fibers. A fiber of $\sigma$ will be called special…

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,…