A spectral lower bound for the divisorial gonality of metric graphs
Abstract
Let be a compact metric graph, and denote by the Laplace operator on with the first non-trivial eigenvalue λ1. We prove the following Yang-Li-Yau type inequality on divisorial gonality γdiv of . There is a universal constant C such that \[γdiv() ≥ C μ() . geo(). λ1()d,\] where the volume μ() is the total length of the edges in , geo is the minimum length of all the geodesic paths between points of of valence different from two, and d 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.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.