← All problems

The simple ordering conjecture for zero-sum subsets of abelian groups

9 years old · traced to

Let (G,+)(G,+) be an abelian group. Let AA be a finite subset of G∖{0}G\setminus\{0\} such that no 22-subset {x,−x}\{x,-x\} is contained in AA, and suppose that

∑a∈Aa=0.\sum_{a\in A}a=0.

A simple ordering of AA is an ordering of its elements whose successive partial sums are distinct. Simple ordering conjecture. There exists a simple ordering of the elements of AA. This conjecture would imply that every Heffter array is simple; its validity was proposed in earlier work, while the existence of square integer Heffter arrays is known. The general assertion remains open.

Equivalent formulations
  1. Let (G,+)(G,+) be an abelian group. Let AA be a finite subset of G∖{0}G\setminus\{0\} such that no 22-subset {x,−x}\{x,-x\} is contained in AA and

    ∑a∈Aa=0.\sum_{a\in A}a=0.

    A simple ordering of AA is an ordering of its elements whose successive partial sums are distinct. Simple ordering conjecture. There exists a simple ordering of the elements of AA. This conjecture concerns sequencing zero-sum subsets of abelian groups under the condition that no element and its inverse both occur; its status is not established by the supplied text.

    source: Simone Costa, Fiorenza Morini, Anita Pasotti and Marco Antonio Pellegrini, “A generalization of Heffter arrays”, arXiv:1906.03932 (2019).

References
  1. Simone Costa, Fiorenza Morini, Anita Pasotti and Marco Antonio Pellegrini, “Globally simple Heffter arrays and orthogonal cyclic cycle decompositions”, arXiv:1709.05812 (2018).

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.