Graham's rearrangement conjecture in finite abelian groups

Abstract

Graham conjectured in 1971 that every subset of the nonzero elements of a prime cyclic group admits an ordering with pairwise distinct nonempty partial sums. Recently, the work of Pham and Sauermann, together with earlier results, settled this conjecture for all sufficiently large primes. In this paper, we prove that there is an absolute integer $n_0$ such that every subset $S\subseteq G\setminus\{0\}$ of a finite abelian group with $|S|\ge n_0$ admits such an ordering, which also solves a conjecture of Alspach and Liversidge for all sufficiently large sets. A key ingredient of our proof is a sufficient condition via additive dimension: If $|S|=n$ and $S$ contains a dissociated subset of size at least $Ω((\log n)^2/\log\log n)$, then $S$ has an ordering in which no proper nonempty interval of consecutive terms sums to zero. This bound is within a factor of $O(\log n/\log\log n)$ of the smallest possible additive dimension of an $n$-element set.

The authors’ abstract, as arXiv lists it. arXiv’s listings, abstracts included, are free for anyone to reuse.

More in Combinatorics

• arXiv preprint · 25 October 2026

  Online Discrepancy of Sparse Random Vectors over Long Horizons

  Nicola Wengiel
• OpenAlex · 26 October 2026

  Mutation-acyclicity in rank four is decidable but not semialgebraic

  Kymani Armstrong-Williams, Edward Hirst, Blake Jackson and 1 other
• arXiv preprint · 27 October 2026

  Local-to-Global Theorems Based on Cones with Applications to Graph Coloring

  Anqi Li and Shayan Oveis Gharan
• OpenAlex · 24 October 2026

  Searching for binary orientable sequences

  Chris J. Mitchell
• arXiv preprint · 27 October 2026

  Finite-Sample Optimal Conformal Prediction Sets under Covariate Shift

  Zhongyang Li

All new papers in Combinatorics