Bounding the number of graph refinements for Brill-Noether existence

Publikation: Arbeitspapier/Preprint › Preprint

Autoren

  • Karl Christ
  • Qixiao Ma

Organisationseinheiten

Forschungs-netzwerk anzeigen

Details

OriginalspracheEnglisch
PublikationsstatusElektronisch veröffentlicht (E-Pub) - 14 Apr. 2023

Abstract

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

Zitieren

Bounding the number of graph refinements for Brill-Noether existence. / Christ, Karl; Ma, Qixiao.
2023.

Publikation: Arbeitspapier/Preprint › Preprint

Christ, K., & Ma, Q. (2023). Bounding the number of graph refinements for Brill-Noether existence. Vorabveröffentlichung online.
Christ K, Ma Q. Bounding the number of graph refinements for Brill-Noether existence. 2023 Apr 14. Epub 2023 Apr 14.
Download
@techreport{ee4ef232988449de9983487c8275fd0b,
title = "Bounding the number of graph refinements for Brill-Noether existence",
abstract = " Let \(G\) be a finite graph of genus \(g\). Let \(d\) and \(r\) be non-negative integers such that the Brill-Noether number is non-negative. It is known that for some \(k\) sufficiently large, the \(k\)-th homothetic refinement \(G^{(k)}\) of \(G\) admits a divisor of degree \(d\) and rank at least \(r\). We use results from algebraic geometry to give an upper bound for \(k\) in terms of \(g,d,\) and \(r\). ",
keywords = "math.AG, math.CO, 05C99 (Primary), 05C57, 14H51 (Secondary)",
author = "Karl Christ and Qixiao Ma",
note = "9 pages, 2 figures",
year = "2023",
month = apr,
day = "14",
language = "English",
type = "WorkingPaper",

}

Download

TY - UNPB

T1 - Bounding the number of graph refinements for Brill-Noether existence

AU - Christ, Karl

AU - Ma, Qixiao

N1 - 9 pages, 2 figures

PY - 2023/4/14

Y1 - 2023/4/14

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

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

KW - math.AG

KW - math.CO

KW - 05C99 (Primary), 05C57, 14H51 (Secondary)

M3 - Preprint

BT - Bounding the number of graph refinements for Brill-Noether existence

ER -