Abstract

In this paper, we consider the following conjecture, proposed by Brian Alspach, concerning partial sums in finite cyclic groups: given a subset A of mathbb {Z}_n{setminus } {0} of size k such that sum _{zin A} znot = 0, it is possible to find an ordering (a_1,ldots ,a_k) of the elements of A such that the partial sums s_i=sum _{j=1}^i a_j, i=1,ldots ,k, are nonzero and pairwise distinct. This conjecture is known to be true for subsets of size kle 11 in cyclic groups of prime order. Here, we extend this result to any torsion-free abelian group and, as a consequence, we provide an asymptotic result in mathbb {Z}_n. We also consider a related conjecture, originally proposed by Ronald Graham: given a subset A of mathbb {Z}_p{setminus }{0}, where p is a prime, there exists an ordering of the elements of A such that the partial sums are all distinct. Working with the methods developed by Hicks, Ollis, and Schmitt, based on Alon’s combinatorial Nullstellensatz, we prove the validity of this conjecture for subsets A of size 12.

Highlights

  • In this paper, we give some new results about a conjecture, due to Brian Alspach, concerning finite cyclic groups

  • K, are nonzero and pairwise distinct. This conjecture is known to be true for subsets of size k ≤ 11 in cyclic groups of prime order. We extend this result to any torsion-free abelian group and, as a consequence, we provide an asymptotic result in Zn

  • We give some new results about a conjecture, due to Brian Alspach, concerning finite cyclic groups

Read more

Summary

Introduction

We give some new results about a conjecture, due to Brian Alspach, concerning finite cyclic groups. We can apply to H the structure theorem for finitely generated abelian groups, obtaining that H is isomorphic to a subgroup of Zk. So, we can view A as a nice subset of Zk. Since, by hypothesis, we are assuming the validity of Alspach’s conjecture in Zp for infinitely many primes p and for any subset of size k, by Propositions 2.2 and 2.3, Alspach’s conjecture holds in Zk for any subset of size k.

Objectives
Results
Conclusion
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call