Minimal zero-sum sequences of length five over finite cyclic groups

preprint2013arXivOpen access

Abstract

Let GG be a finite cyclic group. Every sequence SS of length ll over GG can be written in the form S=(n1g)⋅…⋅(nlg)S=(n_1g)\cdot\ldots\cdot(n_lg) where g∈Gg\in G and $n_1, \ldots, n_l\in[1, \ord(g)]$, and the index $\ind(S)$ of SS is defined to be the minimum of $(n_1+\cdots+n_l)/\ord(g)$ over all possible g∈Gg\in G such that ⟨g⟩=G\langle g \rangle =G. In this paper, we determine the index of any minimal zero-sum sequence SS of length 5 when G=⟨g⟩G=\langle g\rangle is a cyclic group of a prime order and SS has the form S=g2(n2g)(n3g)(n4g)S=g^2(n_2g)(n_3g)(n_4g). It is shown that if G=⟨g⟩G=\langle g\rangle is a cyclic group of prime order p≥31p \geq 31, then every minimal zero-sum sequence SS of the above mentioned form has index 1 except in the case that S=g2(p−12g)(p+32g)((p−3)g)S=g^2(\frac{p-1}{2}g)(\frac{p+3}{2}g)((p-3)g).

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.