Using algebraic geometry, the authors derive an explicit upper bound on the refinement parameter k for which the k-th homothetic refinement of a genus-g graph has a divisor of degree d and rank at least r.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.AG 1years
2023 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Bounding the number of graph refinements for Brill-Noether existence
Using algebraic geometry, the authors derive an explicit upper bound on the refinement parameter k for which the k-th homothetic refinement of a genus-g graph has a divisor of degree d and rank at least r.