CMPP conjecture on sequenceability of zero-sum subsets without inverse pairs

Less than 1 year old · traced to

Let GG be an abelian group, and let AA be a finite subset of G∖{0}G\setminus\{0\}. An ordering a1,…,a∣A∣a_1,\ldots,a_{|A|} of AA is sequenceable if its partial sums

pi=a1+⋯+aip_i=a_1+\cdots+a_i

are pairwise distinct and pi≠0p_i\ne 0 for every 1≤i≤∣A∣−11\leq i\leq |A|-1. CMPP conjecture. Every subset A⊆G∖{0}A\subseteq G\setminus\{0\} whose elements sum to zero and such that {x,−x}⊄A\{x,-x\}\not\subset A for every x∈Gx\in G is sequenceable. The conjecture concerns sequenceability in connection with Heffter arrays; the supplied text does not establish its general status, although it proves the claim for zero-sum subsets without inverse pairs of size at most 2323.

References

Primary source

Simone Costa, Stefano Della Fiore, Mattia Fontana and Lluís Vena, “Graham conjecture on small sets in abelian groups”, arXiv:2603.20961 (2026).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.