Related papers: A note on Brill-Noether thoery and rank determinin…

Clique-width is a complexity measure of directed as well as undirected graphs. Rank-width is an equivalent complexity measure for undirected graphs and has good algorithmic and structural properties. It is in particular related to the…

Chordal graphs are important in algorithmic graph theory. Chordal digraphs are a digraph analogue of chordal graphs and have been a subject of active studies recently. Unlike chordal graphs, chordal digraphs lack many structural properties…

Let $X$ be a non-singular algebraic curve of genus $g$. We prove that the Brill-Noether locus $\bns $ is non-empty if $d= nd' +d'' $ with $0< d'' <2n$, $1\le s\le g$, $d'\geq (s-1)(s+g)/s $, $n\leq d''+(n-k)g$, $(d'',k)\ne(n,n)$. These…

We prove several criteria for quasi-isometry between non-locally-finite graphs and their structure trees. Results of M\"oller in \cite{moeller92ends2} for locally finite and transitive graphs are generalized. We also give a criterion which…

We study classes of graphs with bounded clique-width that are well-quasi-ordered by the induced subgraph relation, in the presence of labels on the vertices. We prove that, given a finite presentation of a class of graphs, one can decide…

For a projective variety X, a line bundle L on X and r a natural number we consider the r-th Brill-Noether locus W^r(L,X):={\eta\in Pic^0(X)|h^0(L+\eta)\geq r+1}: we describe its natural scheme structure and compute the Zariski tangent…

The problem of node-similarity in networks has motivated a plethora of such measures between node-pairs, which make use of the underlying graph structure. However, higher-order relations cannot be losslessly captured by mere graphs and…

We produce explicit elliptic curves over \Bbb F_p(t) whose Mordell-Weil groups have arbitrarily large rank. Our method is to prove the conjecture of Birch and Swinnerton-Dyer for these curves (or rather the Tate conjecture for related…

In this paper, we show that computing canonical labelings of graphs of bounded rank-width is in $\textsf{TC}^{2}$. Our approach builds on the framework of K\"obler & Verbitsky (CSR 2008), who established the analogous result for graphs of…

Let $G$ be a digraph and $r(G)$ be its rank. Many interesting results on the rank of an undirected graph appear in the literature, but not much information about the rank of a digraph is available. In this article, we study the rank of a…

We study Brill-Noether loci of three kinds of spectral curves: classical spectral curves as introduced by Hitchin, spectral curves over the projective line and double covers whose branch locus is a canonical divisor. Our techniques are…

The main result of the paper is motivated by the following two, apparently unrelated graph optimization problems: (A) as an extension of Edmonds' disjoint branchings theorem, characterize digraphs comprising $k$ disjoint branchings $B_i$…

A conjecture in algorithmic model theory predicts that the model-checking problem for first-order logic is fixed-parameter tractable on a hereditary graph class if and only if the class is monadically dependent. Originating in model theory,…

We describe applications of Koszul cohomology to the Brill-Noether theory of rank 2 vector bundles. Among other things, we show that in every genus g>10, there exist curves invalidating Mercat's Conjecture for rank 2 bundles. On the other…

The metric dimension of a graph $G$ is the size of a smallest subset $L \subseteq V(G)$ such that for any $x,y \in V(G)$ with $x\not= y$ there is a $z \in L$ such that the graph distance between $x$ and $z$ differs from the graph distance…

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…

We study the algebraic rank of a divisor on a graph, an invariant defined using divisors on algebraic curves dual to the graph. We prove it satisfies the Riemann-Roch formula, a specialization property, and the Clifford inequality. We prove…

In this paper, we compute the cohomology class of certain "special maximal-rank loci" originally defined by Aprodu and Farkas. By showing that such classes are nonzero, we are able to verify the non-emptiness portion of the Strong Maximal…

The metric dimension of a graph is the least number of vertices in a set with the property that the list of distances from any vertex to those in the set uniquely identifies that vertex. Bailey and Meagher obtained an upper bound on the…

We study the variation of the dimension of the Bloch-Kato Selmer group of a p-adic Galois representation of a number field that varies in a refined family. We show that, if one restricts ourselves to representations that are, at every place…