The simple ordering conjecture for zero-sum subsets of abelian groups
The simple ordering conjecture for zero-sum subsets of abelian groups
Let be an abelian group. Let be a finite subset of such that no -subset is contained in , and suppose that
A simple ordering of is an ordering of its elements whose successive partial sums are distinct. Simple ordering conjecture. There exists a simple ordering of the elements of . 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.
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Equivalent formulations 1
Other statements of this same problem, merged from separate entries. Each is equivalent to the statement above — proving any one settles them all.
The simple ordering conjecture for zero-sum subsets of abelian groups
Let be an abelian group. Let be a finite subset of such that no -subset is contained in and
A simple ordering of is an ordering of its elements whose successive partial sums are distinct. Simple ordering conjecture. There exists a simple ordering of the elements of . 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).
Sources & referencesView supporting material
Primary source
Simone Costa, Fiorenza Morini, Anita Pasotti and Marco Antonio Pellegrini, “Globally simple Heffter arrays and orthogonal cyclic cycle decompositions”, arXiv:1709.05812 (2018).
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.