Bounding the number of graph refinements for Brill-Noether existence
Algebraic Geometry
2026-04-07 v2 Combinatorics
Abstract
Let be a finite graph of genus . Let and be non-negative integers such that the Brill-Noether number is non-negative. It is known that for some sufficiently large, the -th homothetic refinement of admits a divisor of degree and rank at least . We use results from algebraic geometry to give an upper bound for in terms of and .
Cite
@article{arxiv.2304.07405,
title = {Bounding the number of graph refinements for Brill-Noether existence},
author = {Karl Christ and Qixiao Ma},
journal= {arXiv preprint arXiv:2304.07405},
year = {2026}
}
Comments
10 pages, 2 figures; v2: minor changes throughout, final version, to appear in Eur. J. Math