Graham's rearrangement conjecture for subsets of prime cyclic groups
Graham's rearrangement conjecture for subsets of prime cyclic groups
Let ) be prime and let be distinct nonzero elements of . A set of elements is rearrangeable if its elements can be ordered so that all partial sums are distinct. Graham's rearrangement conjecture. There exists a rearrangement such that
are distinct for . This is the central rearrangement problem motivating the paper; the paper proves only an asymptotic version in general groups, while the full assertion remains open.
Sources & referencesView supporting material
Primary source
Matija Bucić, Bryce Frederickson, Alp Müyesser, Alexey Pokrovskiy and Liana Yepremyan, “Towards Graham's rearrangement conjecture via rainbow paths”, arXiv:2503.01825 (2026).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.