Bialostocki–Lotspeich conjecture
Let , let be the cyclic group of order , and let be a sequence over , with repetitions allowed. Define to be the number of subsets such that and in . Then
References
- Enumeration of zero-sum subsequences: A proof of Bialostocki-Lotspeich conjecture — arXiv — Guoqing Wang, Xiangneng Zeng
Source: arXiv
Progress summary
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- zero-sum subsequences in a sequence over a cyclic group of order . A. Bialostocki and M. Lotspeich posed it in 1992.
Known results
- Known for with distinct primes and .
- Known when .
- Known when .
- Known when .
October 2026 claimed proof
Guoqing Wang and Xiangneng Zeng’s preprint asserts the full bound
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.