On the index-conjecture of length four minimal zero-sum sequences II
Abstract
Let G be a finite cyclic group. Every sequence S over G can be written in the form S=(n1g)·...·(nlg) where g∈ G and n1,·s,nl∈[1, ord(g)], and the index ∈d S of S is defined to be the minimum of (n1+·s+nl)/ ord(g) over all possible g∈ G such that g=G. A conjecture says that if G is finite such that (|G|,6)=1, then ∈d(S)=1 for every minimal zero-sum sequence S. In this paper, we prove that the conjecture holds if S is reduced and the (A1) condition is satisfied(see [19]).
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.