On Partial Sums in Cyclic Groups

2015/01/27 by Archdeacon, D. S., Dinitz, J. H., Mattern, A. +1 · 3 citations
Computer Science · Mathematics · Physics and Astronomy · #Advanced Mathematical Theories and Applications #Analytic Number Theory Research #Combinatorics (math.CO) #FOS: Mathematics #Graph Labeling and Dimension Problems

paper · pdf · doi:10.48550/arxiv.1501.06872

openalex publication_date 2015/01/27 · openalex created_date 2016/06/24 · openalex updated_date 2026/07/28

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.

Cited by

• Globally Simple Heffter Arrays H(n;k) with k ≡ 1 \pmod4
• The existence of square non-integer Heffter arrays
• Globally simple Heffter arrays and orthogonal cyclic cycle decompositions

Related

• Some new results about a conjecture by Brian Alspach
• Distinct Partial Sums in Cyclic Groups: Polynomial Method and Constructive Approaches
• On Sequences in Cyclic Groups with Distinct Partial Sums
• A note on the number of distinct elements and zero-sum subsequence lengths in cyclic groups
• Rearranging small sets for distinct partial sums