Graham conjecture on small sets in abelian groups
Number Theory
2026-03-24 v1 Combinatorics
Abstract
A famous conjecture of Graham asserts that every set can be ordered so that all partial sums are distinct. Although this conjecture was recently proved for sufficiently large primes by Pham and Sauermann in~\cite{PM} (combined with earlier results of \cite{BBKMM}), it remains open for general abelian groups, even in the cyclic case . In this paper, using a recursive approach, we investigate the sequenceability of subsets in generic abelian groups for small values of . We prove that any subset with is sequenceable where previously it was known only for . This bound is improved to for zero-sum subsets. Finally, regarding the related CMPP conjecture, we show that zero-sum subsets without inverse pairs are sequenceable for .
Cite
@article{arxiv.2603.20961,
title = {Graham conjecture on small sets in abelian groups},
author = {Simone Costa and Stefano Della Fiore and Mattia Fontana and Lluís Vena},
journal= {arXiv preprint arXiv:2603.20961},
year = {2026}
}