ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let nn be a positive integer, and let knk_n be an integer depending on nn. A graph is biconnected if it has the connectivity property intended in the paper. Bounded multiplicity conjecture. For any positive integer nn, there exists knk_n such that, whenever k>knk>k_n, there is no biconnected graph GG satisfying

Jac⁡(G)≃(Z/nZ)k.\operatorname{Jac}(G)\simeq\left(\mathbb{Z}/n\mathbb{Z}\right)^k.

The conjecture is motivated by the observation that random graphs are highly connected and that Jacobians of most graphs appear to have few invariant factors. The supplied text gives no resolution, so the conjecture remains 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.