On Graham's rearrangement conjecture
Huy Tuan Pham, Lisa Sauermann

TL;DR
This paper proves Graham's rearrangement conjecture for large subsets of the non-zero elements of prime fields, confirming that such subsets can be ordered to produce all distinct partial sums, thus resolving the conjecture for large primes.
Contribution
The paper establishes the conjecture for subsets of size up to a power of the prime, completing the proof for all sufficiently large primes.
Findings
Confirmed Graham's conjecture for subsets with size up to p^{1-eta}
Resolved the conjecture for all large primes p
Provided new bounds for subset sizes in the conjecture
Abstract
Graham conjectured in 1971 that for any prime , any subset admits an ordering where all partial sums are distinct. We prove this conjecture for all subsets with and sufficiently large with respect to , for any . Combined with earlier results, this gives a complete resolution of Graham's rearrangement conjecture for all sufficiently large primes .
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 · Mathematical Dynamics and Fractals
