ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let g≥2g\geq 2. A trivalent graph of genus gg with largest possible automorphism group means a trivalent graph whose automorphism group has maximal size among trivalent graphs of genus gg. A graph is Brill–Noether general if, for every pair of positive integers rr and dd such that

ρdr(g)=g−(r+1)(g−d+r)\rho^r_d(g)=g-(r+1)(g-d+r)

is negative, it has no effective divisor of degree dd and rank at least rr. Caporaso's conjecture. Every trivalent graph of genus g≥2g\geq 2 with largest possible automorphism group is Brill–Noether general. The paper disproves this conjecture by constructing Brill–Noether special maximally symmetric trivalent graphs in sufficiently large genus; the abstract states such counterexamples occur in every sufficiently large genus.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.