ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let Γ\Gamma be a metric graph of genus gg. A minimal rank-determining set is a rank-determining set of Γ\Gamma that has no proper subset that is rank-determining. Cardinality bound conjecture. Every minimal rank-determining set of Γ\Gamma has cardinality at most g+1g+1. This conjecture proposes a universal upper bound on the size of minimal rank-determining sets, following the construction of minimal rank-determining sets with g+1g+1 points; whether all metric graphs satisfy this bound 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 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.