Discrete and metric divisorial gonality can be different

DOI10.1016/J.JCTA.2022.105619MaRDI QIDQ2120835zbMATH OpenOpenAlexFDO

Authors Josse van Dobben de Bruyn, Harry Smit, Marieke van der Wegen

Publication date 1 April 2022

Published in Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://arxiv.org/abs/2106.12568

zbMATH Keywords

finite graphmetric graphchip-firing gamegonality

Mathematics Subject Classification ID

Games on graphs (graph-theoretic aspects) (05C57) Graph representations (geometric and intersection representations, etc.) (05C62) Games involving graphs (91A43) Arithmetic ground fields for curves (14H25) Tropical geometry (14T99)

Abstract: This paper compares the divisorial gonality of a finite graph $G$ to the divisorial gonality of the associated metric graph $Gamma(G,mathbb1)$ with unit lengths. We show that $extdgon(Gamma(G,mathbb1))$ is equal to the minimal divisorial gonality of all regular subdivisions of $G$, and we provide a class of graphs for which this number is strictly smaller than the divisorial gonality of $G$. This settles a conjecture of M. Baker in the negative.

Recommendations

• A Spectral Lower Bound for the Divisorial Gonality of Metric Graphs
• On metric graphs with prescribed gonality
• Graphs of gonality three
• Computing graph gonality is hard
• Treewidth is a lower bound on graph gonality

Cites work

• A Riemann-Roch theorem in tropical geometry
• A note on Brill-Noether existence for graphs of low genus
• A tropical proof of the Brill-Noether theorem
• Algebraic and combinatorial Brill-Noether theory
• Catalan-many tropical morphisms to trees. Part I: Constructions
• Chip-firing and the critical group of a graph
• Chip-firing games on graphs
• Computing graph gonality is hard
• Degeneration of linear series from the tropical point of view and applications
• On the Gonality of Metric Graphs
• On the gonality of Cartesian products of graphs
• On the scramble number of graphs
• Practical graph isomorphism. II.
• Rank of divisors on tropical curves
• Rank-determining sets of metric graphs
• Riemann-Roch and Abel-Jacobi theory on a finite graph
• Self-organized critical state of sandpile automaton models
• Specialization of linear systems from curves to graphs (with an appendix by Brian Conrad)
• Stable divisorial gonality is in NP
• Treewidth is a lower bound on graph gonality
• Understanding and using linear programming

Cited in

(3)

• On the gonality of Cartesian products of graphs
• On the semigroup of graph gonality sequences
• The relation between the gonality and the Clifford index of a chain of cycles

Describes a project that uses

Uses Software

• nauty

This page was built for publication: Discrete and metric divisorial gonality can be different

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2120835)