A spectral lower bound for the divisorial gonality of metric graphs
Algebraic Geometry
2014-10-28 v2 Combinatorics
Metric Geometry
Abstract
Let be a compact metric graph, and denote by the Laplace operator on with the first non-trivial eigenvalue . We prove the following Yang-Li-Yau type inequality on divisorial gonality of . There is a universal constant such that where the volume is the total length of the edges in , is the minimum length of all the geodesic paths between points of of valence different from two, and is the largest valence of points of . Along the way, we also establish discrete versions of the above inequality concerning finite simple graph models of 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