Minimal zero-sum sequences of length four over finite cyclic groups. II.

From MaRDI portal



Abstract: Let G be a finite cyclic group. Every sequence S over G can be written in the form S=(n1g)cdotldotscdot(nlg) where ginG and n1,ldots,nlin[1,ord(g)], and the index ind(S) of S is defined to be the minimum of (n1+cdots+nl)/ord(g) over all possible ginG such that langlegangle=G. An open problem on the index of length four sequences asks whether or not every minimal zero-sum sequence of length 4 over a finite cyclic group G with gcd(|G|,6)=1 has index 1. In this paper, we show that if G=langlegangle is a cyclic group with order of a product of two prime powers and gcd(|G|,6)=1, then every minimal zero-sum sequence S of the form S=(g)(n2g)(n3g)(n4g) has index 1. In particular, our result confirms that the above problem has an affirmative answer when the order of G is a product of two different prime numbers or a prime power, extending a recent result by the first author, Plyley, Yuan and Zeng.





Cited in
(25)








This page was built for publication: Minimal zero-sum sequences of length four over finite cyclic groups. II.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4923253)