Note on a Conjecture of Graham
David J. Grynkiewicz

TL;DR
This paper provides a simple proof of Graham's conjecture on zero-sum sequences in cyclic groups, extending to non-prime cases and arbitrary finite abelian groups, with detailed structural descriptions.
Contribution
It offers a concise proof of Graham's conjecture using elementary theorems, and generalizes the result to broader group settings with explicit structural characterizations.
Findings
A short proof of Graham's conjecture using the Cauchy-Davenport Theorem.
An alternative proof for non-prime cases employing the Devos-Goddyn-Mohar Theorem.
A comprehensive structural description of sequences satisfying the conjecture in finite abelian groups.
Abstract
An old conjecture of Graham stated that if is a prime and is a sequence of terms from the cyclic group such that all (nontrivial) zero-sum subsequences have the same length, then must contain at most two distinct terms. In 1976, Erd\H{o}s and Szemeredi gave a proof of the conjecture for sufficiently large primes . However, the proof was complicated enough that the details for small primes were never worked out. Both in the paper of Erd\H{o}s and Szemeredi and in a later survey by Erd\H{o}s and Graham, the complexity of the proof was lamented. Recently, a new proof, valid even for non-primes , was given by Gao, Hamidoune and Wang, using Savchev and Chen's recently proved structure theorem for zero-sum free sequences of long length in . However, as this is a fairly involved result, they did not believe it to be the simple proof sought by Erd\H{o}s, Graham…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsLimits and Structures in Graph Theory · Analytic Number Theory Research · Advanced Topology and Set Theory
