Recognition: unknown
Brill-Noether Theory of Maximally Symmetric Graphs
classification
🧮 math.AG
math.CO
keywords
genusbrill-noethergraphsleastmultigraphsautomorphismgrouploops
read the original abstract
We analyze the Brill-Noether theory of trivalent graphs and multigraphs having largest possible automorphism group in a fixed genus. For trivalent multigraphs with loops of genus at least 3, we show that there exists a graph with maximal automorphism group which is Brill-Noether special. We prove similar results for multigraphs without loops of genus at least 6, as well as simple graphs of genus at least 7. This analysis yields counterexamples, in any sufficiently large genus, to a conjecture of Caporaso.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.