Related papers: Bounding the number of graph refinements for Brill…

In an influential 2008 paper, Baker proposed a number of conjectures relating the divisor theory of algebraic curves with an analogous combinatorial theory on finite graphs. In this note, we examine Baker's Brill--Noether existence…

We study Brill-Noether existence on a finite graph using methods from polyhedral geometry and lattices. We start by formulating analogues of the Brill-Noether conjectures (both the existence and non-existence parts) for…

The interplay between algebro-geometric and combinatorial Brill-Noether theory is studied. The Brill-Noether variety of a graph shown to be non-empty if the Brill-Noether number is non-negative, as a consequence of the analogous fact for…

We produce open subsets of the moduli space of metric graphs without separating edges where the dimensions of Brill-Noether loci are larger than the corresponding Brill-Noether numbers. These graphs also have minimal rank determining sets…

Let $G$ be a connected undirected graph on $n$ vertices with no loops but possibly multiedges. Given an arithmetical structure $(\textbf{r}, \textbf{d})$ on $G$, we describe a construction which associates to it a graph $G'$ on $n-1$…

The classical Brill-Noether theorems count the dimension of the family of maps from a general curve of genus g to non-degenerate curves of degree d in r-dimensional projective space. These theorems can be extended to include ramification…

In this paper, we study maps from reducible curves $f : C \cup_\Gamma D \to \mathbb{P}^r$. We restrict our attention to two cases: first, when $f|_D$ factors through a hyperplane $H$ and $f|_C$ is transverse to $H$; and second, when $r =…

The bend-number b(G) of a graph G is the minimum k such that G may be represented as the edge intersection graph of a set of grid paths with at most k bends. We confirm a conjecture of Biedl and Stern showing that the maximum bend-number of…

We consider a general curve of fixed gonality k and genus g. We propose an estimate for the dimension of the variety $W^r_d(C)$ of special linear series on C, by solving an analogous problem in tropical geometry. Using work of Coppens and…

We prove an enumerative formula for the algebraic Euler characteristic of Brill-Noether varieties, parametrizing degree d and rank r linear series on a general genus g curve, with ramification profiles specified at up to two general points.…

Let $G = (V,E)$ be a graph and $k \ge 0$ an integer. A $k$-independent set $S \subseteq V$ is a set of vertices such that the maximum degree in the graph induced by $S$ is at most $k$. With $\alpha_k(G)$ we denote the maximum cardinality of…

Let $f\colon C \rightarrow \mathbb{P}^1$ be a degree $k$ genus $g$ cover. The stratification of line bundles $L \in \mathrm{Pic}^d(C)$ by the splitting type of $f_*L$ is a refinement of the stratification by Brill-Noether loci $W^r_d(C)$.…

For a projective nonsingular curve of genus $g$, the Brill-Noether locus $W^r_d(C)$ parametrizes line bundles of degree $d$ over $C$ with at least $r+1$ sections. When the curve is generic and the Brill-Noether number $\rho(g,r,d)$ equals…

A graph is $(d_1, ..., d_r)$-colorable if its vertex set can be partitioned into $r$ sets $V_1, ..., V_r$ so that the maximum degree of the graph induced by $V_i$ is at most $d_i$ for each $i\in \{1, ..., r\}$. For a given pair $(g, d_1)$,…

For a positive integer $k\ge 1$, a graph $G$ is $k$-stepwise irregular ($k$-SI graph) if the degrees of every pair of adjacent vertices differ by exactly $k$. Such graphs are necessarily bipartite. Using graph products it is demonstrated…

Brill-Noether theory studies the existence and deformations of curves in projective spaces; its basic object of study is $\mathcal{W}^r_{d,g}$, the moduli space of smooth genus $g$ curves with a choice of degree $d$ line bundle having at…

The divisor theory of the complete graph $K_n$ is in many ways similar to that of a plane curve of degree $n$. We compute the splitting types of all divisors on the complete graph $K_n$. We see that the possible splitting types of divisors…

A graph G is (d_1,..,d_l)-colorable if the vertex set of G can be partitioned into subsets V_1,..,V_l such that the graph G[V_i] induced by the vertices of V_i has maximum degree at most d_i for all 1 <= i <= l. In this paper, we focus on…

Let $G$ be a finite group, and let ${\rm{cd}}(G)$ denote the set of degrees of the irreducible complex characters of $G$. The degree graph $\Delta(G)$ of $G$ is defined as the simple undirected graph whose vertex set ${\rm{V}}(G)$ consists…

A solution to a problem of Erd\H{o}s, Rubin and Taylor is obtained by showing that if a graph $G$ is $(a:b)$-choosable, and $c/d > a/b$, then $G$ is not necessarily $(c:d)$-choosable. The simplest case of another problem, stated by the same…