Article ID Journal Published Year Pages File Type
6415604 Journal of Number Theory 2013 22 Pages PDF
Abstract

Let G be a finite cyclic group. Every sequence S over G can be written in the form S=(n1g)⋅⋯⋅(nkg) where g∈G and n1,…,nk∈[1,ord(g)], and the index ind S of S is defined to be the minimum of (n1+⋯+nk)/ord(g) over all possible g∈G such that 〈g〉=G. A conjecture says that if G is finite such that gcd(|G|,6)=1, then ind(S)=1 for every minimal zero-sum sequence S. In this paper, we prove that the conjecture holds if |G| has two prime factors.

Related Topics
Physical Sciences and Engineering Mathematics Algebra and Number Theory
Authors
, ,