English

A spectral lower bound for the divisorial gonality of metric graphs

Algebraic Geometry 2014-10-28 v2 Combinatorics Metric Geometry

Abstract

Let Γ\Gamma be a compact metric graph, and denote by Δ\Delta the Laplace operator on Γ\Gamma with the first non-trivial eigenvalue λ1\lambda_1. We prove the following Yang-Li-Yau type inequality on divisorial gonality γdiv\gamma_{div} of Γ\Gamma. There is a universal constant CC such that γdiv(Γ)Cμ(Γ).mingeo(Γ).λ1(Γ)dmax,\gamma_{div}(\Gamma) \geq C \frac{\mu(\Gamma) . \ell_{\min}^{\mathrm{geo}}(\Gamma). \lambda_1(\Gamma)}{d_{\max}}, where the volume μ(Γ)\mu(\Gamma) is the total length of the edges in Γ\Gamma, mingeo\ell_{\min}^{\mathrm{geo}} is the minimum length of all the geodesic paths between points of Γ\Gamma of valence different from two, and dmaxd_{\max} is the largest valence of points of Γ\Gamma. Along the way, we also establish discrete versions of the above inequality concerning finite simple graph models of Γ\Gamma and their spectral gaps.

Keywords

Cite

@article{arxiv.1407.5614,
  title  = {A spectral lower bound for the divisorial gonality of metric graphs},
  author = {Omid Amini and Janne Kool},
  journal= {arXiv preprint arXiv:1407.5614},
  year   = {2014}
}

Comments

22 pages, added new recent references, minor revision