NP-completeness conjecture for metric divisorial gonality
Statement
Fix a positive integer . For a metric graph with rational edge lengths, the Metric Divisorial Gonality problem asks whether for a given integer . Metric divisorial gonality conjecture. The Metric Divisorial Gonality problem is NP-complete. Membership in NP is known when both and are fixed; extending the argument to variable , for example with bounded by , is left open.
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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.