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₀ such that every subset S⊆ G∖{0} of a finite abelian group with |S|≥ n₀ 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)²/loglog 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/loglog n) of the smallest possible additive dimension of an n-element set.

Anti-concentration and Graham's rearrangement problem in finite abelian groups
Hoi H. Nguyen, Tuan Tran, Van H. Vu
arXiv29 Oct 2026PreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
Finite abelian subgroups of algebraic groups
Danny Ofek, Zinovy Reichstein, Federico Scavia
HAL3 Aug 2026PreprintLicence not statedAlgebra & number theoryHAL
Finite abelian groups are Schur multipliers of finite solvable groups
Derek F. Holt
arXiv1 Oct 2026PreprintCC BY-NC-SA 4.0Full textAlgebra & number theoryarXiv
On Intersection Hypergraph of Finite Non-Cyclic Abelian Groups
A N Ardra, S Ballal
arXiv12 Oct 2026PreprintCC BY 4.0Full textCombinatorics & discrete mathematicsarXiv
The Tate conjecture for abelian fivefolds over finite fields
Ningyi Li
arXiv8 Oct 2026PreprintarXiv licenceFull textAlgebra & number theoryarXiv

Cite

BibTeX RIS

BibTeX

@misc{kuang2026grahams,
  title = {{Graham's rearrangement conjecture in finite abelian groups}},
  author = {Peiru Kuang and Yan Wang},
  howpublished = {arXiv},
  year = {2026},
  month = oct,
  doi = {10.48550/arxiv.2610.34424},
  eprint = {2610.34424},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2610.34424},
}

RIS

TY  - UNPB
TI  - Graham's rearrangement conjecture in finite abelian groups
AU  - Peiru Kuang
AU  - Yan Wang
PY  - 2026
DA  - 2026/10/25
PB  - arXiv
DO  - 10.48550/arxiv.2610.34424
UR  - https://arxiv.org/abs/2610.34424
AB  - 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⊆ G∖{0} of a finite abelian group with |S|≥ 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/loglog 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/loglog n) of the smallest possible additive dimension of an n-element set.
ER  -

Abstract

Related

Cite