ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let Γ\Gamma be a trivalent maximally symmetric graph or multigraph of genus gg; multigraphs may have loops or may be loopless. 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. The non-generality conjecture. If gg is sufficiently large, then Γ\Gamma is not Brill–Noether general. This conjecture is motivated by the explicit counterexamples for maximally symmetric trivalent graphs, loopless multigraphs, and simple graphs established in the paper; the exact threshold for the general class is not stated in the supplied text.

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.