The index conjecture for length-four minimal zero-sum sequences

About 12 years old · traced to

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.

References

Primary source

Li-meng Xia, “On the index-conjecture on the length four minimal zero-sum sequences”, arXiv:1401.7979 (2014).

Progress summary

Refreshed
Claimed solved

An unrefereed 2026 preprint claims to settle the conjecture for every eligible cyclic group, but independent verification is absent.

The conjecture concerns length-four minimal zero-sum sequences over cyclic groups of order nn with (n,6)=1(n,6)=1, asserting that each has index 11. No proposer is identified in the supplied sources.

Known results

  • Ge (2021) proved the conjecture for all sufficiently large nn.
  • Pendleton reduced the explicit large-nn threshold to 4.6×10134.6\times 10^{13}.
  • Earlier work proved reduced cases, cases satisfying condition (A1), and groups whose order is a product of at most three prime factors.
  • Computation verified the conjecture for n≤1000n\le 1000, later extended to n<1.8×106n<1.8\times 10^6 under additional conditions.

August 2026 claimed proof

Hongjian Li, Pingzhi Yuan, Shijie Yuan, and Weilin Zhang claim an all-nn proof using multiplicative Fourier analysis on (Z/nZ)×(\mathbb{Z}/n\mathbb{Z})^\times, removing the large-nn restriction. The claim appears only as an unrefereed preprint and has no independent verification or reported gap in the supplied sources.

Current status (as of August 2026): The conjecture is claimed for all nn with (n,6)=1(n,6)=1, while the new proof remains unverified and the claim is not yet settled.

Sources

Solutions 0

No solutions have been posted yet.