Graham conjecture on small sets in abelian groups

Abstract

A famous conjecture of Graham asserts that every set A ⊂eq Zp \0\ 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~PM (combined with earlier results of BBKMM), it remains open for general abelian groups, even in the cyclic case Zk. In this paper, using a recursive approach, we investigate the sequenceability of subsets A in generic abelian groups for small values of |A|. We prove that any subset A ⊂eq G\0\ with |A| ≤ 20 is sequenceable where previously it was known only for |A|≤ 9. This bound is improved to |A| ≤ 22 for zero-sum subsets. Finally, regarding the related CMPP conjecture, we show that zero-sum subsets without inverse pairs are sequenceable for |A| ≤ 23.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…