Graham's rearrangement conjecture for subsets of prime cyclic groups

About 1 year old · traced to

Let pp) be prime and let a1,a2,…,ada_1,a_2,\dots,a_d be distinct nonzero elements of Zp\mathbb{Z}_p. 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 ai1,ai2,…,aida_{i_1},a_{i_2},\dots,a_{i_d} such that

∑j=1taij\sum_{j=1}^t a_{i_j}

are distinct for 1≤t≤d1\leq t\leq d. 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.

References

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

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.