English

Bounding the number of graph refinements for Brill-Noether existence

Algebraic Geometry 2026-04-07 v2 Combinatorics

Abstract

Let GG be a finite graph of genus gg. Let dd and rr be non-negative integers such that the Brill-Noether number is non-negative. It is known that for some kk sufficiently large, the kk-th homothetic refinement G(k)G^{(k)} of GG admits a divisor of degree dd and rank at least rr. We use results from algebraic geometry to give an upper bound for kk in terms of g,d,g,d, and rr.

Keywords

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