Related papers: A note on Brill-Noether thoery and rank determinin…
This paper investigates the construction of rank-metric codes with specified Ferrers diagram shapes. These codes play a role in the multilevel construction for subspace codes. A conjecture from 2009 provides an upper bound for the dimension…
Semialgebraic graphs are graphs whose vertices are points in $\mathbb{R}^d$, and adjacency between two vertices is determined by the truth value of a semialgebraic predicate of constant complexity. We show how to harness polynomial…
A large number of NP-hard graph problems become polynomial-time solvable on graph classes where the mim-width is bounded and quickly computable. Hence, when solving such problems on special graph classes, it is helpful to know whether the…
In this paper we compute the gonality and the dimension of the Brill-Noether loci $W^1_d(C)$ for curves in a non primitive linear system of a simple abelian surface, adapting vector bundles techniques \`a la Lazarsfeld originally introduced…
Euler graphs are characterized by the simple criterion that degree of each node is even. By restricting on the cycle types yet additional intrinsic properties of Euler graphs are unveiled. For example, regularity higher than degree two is…
Consider the moduli space $M_C(r; K_C)$ of stable rank r vector bundles on a curve $C$ with canonical determinant, and let $h$ be the maximum number of linearly independent global sections of these bundles. If $C$ embeds in a K3 surface $X$…
We prove that for any fixed r>=2, the tree-width of graphs not containing K_r as a topological minor (resp. as a subgraph) is bounded by a linear (resp. polynomial) function of their rank-width. We also present refinements of our bounds for…
The classical Brill-Noether theorem states that a map from a general curve to a projective space deforms in a family of expected dimension as long as its image does not lie in any hyperplane. In this note, we observe, as a direct…
We define a metric filtration of the Gordian graph by an infinite family of 1-dense subgraphs. The n-th subgraph of this family is generated by all knots whose fundamental groups surject to a symmetric group with parameter at least n, where…
Splitting type loci are the natural generalizations of Brill-Noether varieties for curves with a distinguished map to the projective line. We give a tropical proof of a theorem of H. Larson, showing that splitting type loci have the…
mim-width is a recent graph width measure that has seen applications in graph algorithms and problems related to propositional satisfiability. In this paper, we show linear lower bounds for the mim-width of strongly chordal split graphs,…
Deciding whether a graph can be embedded in a grid using only unit-length edges is NP-complete, even when restricted to binary trees. However, it is not difficult to devise a number of graph classes for which the problem is polynomial, even…
Clique-width is a well-studied graph parameter owing to its use in understanding algorithmic tractability: if the clique-width of a graph class ${\cal G}$ is bounded by a constant, a wide range of problems that are NP-complete in general…
Daligault, Rao and Thomass\'e asked whether a hereditary class of graphs well-quasi-ordered by the induced subgraph relation has bounded clique-width. Lozin, Razgon and Zamaraev recently showed that this is not true for classes defined by…
We describe a method for bounding the rank of an elliptic curve under the assumptions of the Birch and Swinnerton-Dyer conjecture and the generalized Riemann hypothesis. As an example, we compute, under these conjectures, exact upper bounds…
The geometry of divisors on algebraic curves has been studied extensively over the years. The foundational results of this Brill-Noether theory imply that on a general curve, the spaces parametrizing linear series (of fixed degree and…
We present a class of (diamond, even hole)-free graphs with no clique cutset that has unbounded rank-width. In general, even-hole-free graphs have unbounded rank-width, because chordal graphs are even-hole-free. A.A. da Silva, A. Silva and…
We consider the problem of estimating the graph size, where one is given only local access to the graph. We formally define a query model in which one starts with a \emph{seed} node and is allowed to make queries about neighbours of nodes…
Severi varieties and Brill-Noether theory of curves on K3 surfaces are well understood. Yet, quite little is known for curves on abelian surfaces. Given a general abelian surface $S$ with polarization $L$ of type $(1,n)$, we prove…
The first goal of this article is to survey recent progress in Brill--Noether theory, including both the study of the moduli space of maps from a curve to projective space and the geometry of the resulting curves in projective space. The…