Minimal zero-sum sequences of length five over finite cyclic groups
Abstract
Let G be a finite cyclic group. Every sequence S of length l over G can be written in the form S=(n1g)·…·(nlg) where g∈ G and n1, …, nl∈[1, (g)], and the index ∈d(S) of S is defined to be the minimum of (n1+·s+nl)/(g) over all possible g∈ G such that g =G. In this paper, we determine the index of any minimal zero-sum sequence S of length 5 when G= g is a cyclic group of a prime order and S has the form S=g2(n2g)(n3g)(n4g). It is shown that if G= g is a cyclic group of prime order p ≥ 31, then every minimal zero-sum sequence S of the above mentioned form has index 1 except in the case that S=g2(p-12g)(p+32g)((p-3)g).
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.