Skip to main content
Log in

On the structure of long zero-sum free sequences and n-zero-sum free sequences over finite cyclic groups

  • Published:
Archiv der Mathematik Aims and scope Submit manuscript

Abstract

In an additively written abelian group, a sequence is called zero-sum free if each of its nonempty subsequences has sum different from the zero element of the group. In this paper, we consider the structure of long zero-sum free sequences and n-zero-sum free sequences over finite cyclic groups \({\mathbb{Z}_n}\). Among which, we determine the structure of the long zero-sum free sequences of length between \({n/3+1 }\) and \({n/2}\), where \({n\ge 50}\) is an odd integer, and we provide a general description on the structure of n-zero-sum free sequences of length n + l, where \({\ell\geq n/p+p-2}\) and p is the smallest prime dividing n.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Bovey J.D., Erdős P., Niven I.: Conditions for a zero sum modulo n, Canad. Math. Bull. 18, 27–29 (1975)

    Article  MATH  Google Scholar 

  2. DeVos M., Goddyn L., Mohar B.: A generalization of Kneser’s addition theorem. Adv. Math. 220, 1531–1548 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  3. Gao W.D.: A combinatorial problem on finite abelian groups. J. Number Theory 58, 100–103 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  4. W.D. Gao, Zero sums in finite cyclic groups, Integers (2000), A12, 7 pp.

  5. A. Geroldinger, Additive group theory and non-unique factorizations, in Combinatorial number Theory and Additive Group Theory, eds. A. Geroldinger and I. Ruzsa, Advanced Courses in Mathematics CRM Barcelona (Birkha̋user, Basel, 2009), pp. 1–86.

  6. Li Y., Peng J.: Minimal zero-sum sequences of length four over finite cyclic groups II. Int. J. Number Theory, 9, 845–866 (2013)

    Article  MathSciNet  MATH  Google Scholar 

  7. Li Y., Plyley C., Yuan P., Zeng X.: Minimal zero sum sequences of length four over finite cyclic groups, J. Number Theory. 130, 2033–2048 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  8. Peng J., Li Y.: Minimal zero-sum sequences of length five over finite cyclic groups. Ars Combinatoria 112, 373–384 (2013)

    MathSciNet  MATH  Google Scholar 

  9. Savchev S., Chen F.: Long zero-free sequences in finite cyclic groups. Discrete Math. 307, 2671–2679 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  10. Savchev S., Chen Long F.: n-zero-free sequences in finite cyclic groups. Discrete Math. 308, 1–8 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  11. Yuan P.: On the index of minimal zero-sum sequences over finite cyclic groups. J. Combin. Theory Ser. A 114, 1545–1551 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  12. P. Yuan and Y. Li, Long unsplittable zero-sum sequences over a finite cyclic group, Int. J. Number Theory, Accepted, 2015.

  13. X. Zeng, P. Yuan, and Y. Li, On the structure of long unsplittable minimal zero-sum sequences, Submitted, 2015.

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Yuanlin Li.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Gao, W., Li, Y., Yuan, P. et al. On the structure of long zero-sum free sequences and n-zero-sum free sequences over finite cyclic groups. Arch. Math. 105, 361–370 (2015). https://doi.org/10.1007/s00013-015-0813-y

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00013-015-0813-y

Mathematics Subject Classification

Keywords

Navigation