Indexed metadata

Graham's rearrangement conjecture in finite abelian groups

Peiru Kuang, Yan Wang

Source record

Source: arXiv

Published: Oct 25, 2026

arXiv: 2610.34424

Open original source ↗

Source 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 n0n_0 such that every subset S⊆G∖{0}S\subseteq G\setminus\{0\} of a finite abelian group with ∣S∣≥n0|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|S|=n and SS contains a dissociated subset of size at least Ω((log⁡n)2/log⁡log⁡n)Ω((\log n)^2/\log\log n), then SS 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)O(\log n/\log\log n) of the smallest possible additive dimension of an nn-element set.

Evidence graph

No public relationships recorded yet.

Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.