← All problems

Bialostocki–Lotspeich conjecture

Let n≥2n\ge 2, let CnC_n be the cyclic group of order nn, and let S=g1⋅…⋅gℓS=g_1\cdot\ldots\cdot g_\ell be a sequence over CnC_n, with repetitions allowed. Define N0n(S)\mathsf N_0^n(S) to be the number of subsets I⊆{1,…,ℓ}I\subseteq\{1,\ldots,\ell\} such that ∣I∣=n|I|=n and ∑i∈Igi=0\sum_{i\in I}g_i=0 in CnC_n. Then

N0n(S)≥(⌊∣S∣/2⌋n)+(⌈∣S∣/2⌉n).\mathsf N_0^n(S)\ge \binom{\lfloor |S|/2\rfloor}{n}+\binom{\lceil |S|/2\rceil}{n}.
References

Progress summary

Refreshed
Open · solution reported

A new preprint claims the 1992 conjecture is proved, but the claim has not been independently checked.

The Bialostocki–Lotspeich conjecture predicts a sharp lower bound for the number of length-nn zero-sum subsequences in a sequence over a cyclic group of order nn. A. Bialostocki and M. Lotspeich posed it in 1992.

Known results

  • Known for n=paqbn=p^a q^b with distinct primes p,qp,q and b∈{0,1}b\in\{0,1\}.
  • Known when ∣S∣≥6n|S|\ge 6n.
  • Known when ∣S∣<5n/2|S|<5n/2.
  • Known when ∣S∣≤19n/3|S|\le 19n/3.

October 2026 claimed proof

Guoqing Wang and Xiangneng Zeng’s preprint asserts the full bound

N0n(S)≥(⌊∣S∣/2⌋n)+(⌈∣S∣/2⌉n).N_0^n(S)\ge\binom{\lfloor |S|/2\rfloor}{n}+\binom{\lceil |S|/2\rceil}{n}.

If correct, this settles the conjecture; no independent assessment or proof-gap analysis was found.

Current status (as of October 2026): The conjecture has a claimed complete proof in an unrefereed preprint, but its validity remains unverified.

Sources

Solutions 0

No solutions have been posted yet.