On Partial Sums in Cyclic Groups

Abstract

We are interested in ordering the elements of a subset A of the non-zero integers modulo n in such a way that all the partial sums are distinct. We conjecture that this can always be done and we prove various partial results about this problem.

References in corpus (1)

• Heffter Arrays and Biembedding Graphs on Surfaces

Cited by in corpus (7)

• Globally simple Heffter arrays and orthogonal cyclic cycle decompositions
• On $\lambda$-fold relative Heffter arrays and biembedding multigraphs on surfaces
• Tight Heffter Arrays Exist for all Possible Values: The Research Report
• Sequences in Dihedral Groups with Distinct Partial Products
• Biembeddings of cycle systems using integer Heffter arrays
• The existence of square non-integer Heffter arrays
• New methods to attack the Buratti-Horak-Rosa conjecture