ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a finite cyclic group of order ∣G∣|G|, and let SS be a sequence over GG. Write

S=(n1g)⋅…⋅(nkg),S=(n_1g)\cdot\ldots\cdot(n_kg),

where gg generates GG, and define

ind⁡(S)=min⁡{n1+⋯+nkord⁡(g):g∈G, ⟨g⟩=G}.\operatorname{ind}(S)=\min\left\{\frac{n_1+\cdots+n_k}{\operatorname{ord}(g)}: g\in G,\ \langle g\rangle=G\right\}.

A sequence is minimal zero-sum if it has sum zero and no proper nontrivial subsequence has sum zero. The index conjecture. If gcd⁡(∣G∣,6)=1\gcd(|G|,6)=1, then every minimal zero-sum sequence SS over GG of length ∣S∣=4|S|=4 satisfies

ind⁡(S)=1.\operatorname{ind}(S)=1.

The paper proves the conjecture under the additional assumption that SS is reduced and at least one coefficient in a representation of SS is coprime to ∣G∣|G|; the general length-four case is not resolved 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.