English

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

Combinatorics 2013-03-08 v1

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 gGg\in G and n1,,nl[1,\ord(g)]n_1, \ldots, n_l\in[1, \ord(g)], and the index \ind(S)\ind(S) of SS is defined to be the minimum of (n1++nl)/\ord(g)(n_1+\cdots+n_l)/\ord(g) over all possible gGg\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=gG=\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=gG=\langle g\rangle is a cyclic group of prime order p31p \geq 31, then every minimal zero-sum sequence SS of the above mentioned form has index 1 except in the case that S=g2(p12g)(p+32g)((p3)g)S=g^2(\frac{p-1}{2}g)(\frac{p+3}{2}g)((p-3)g).

Keywords

Cite

@article{arxiv.1303.1676,
  title  = {Minimal zero-sum sequences of length five over finite cyclic groups},
  author = {Jiangtao Peng and Yuanlin Li},
  journal= {arXiv preprint arXiv:1303.1676},
  year   = {2013}
}

Comments

8 Pages. Accepted for publication in Ars Combinatoria

R2 v1 2026-06-21T23:38:10.487Z