On the unsplittable minimal zero-sum sequences over finite cyclic groups of prime order

Abstract

Let p > 155 be a prime and let G be a cyclic group of order p. Let S be a minimal zero-sum sequence with elements over G, i.e., the sum of elements in S is zero, but no proper nontrivial subsequence of S has sum zero. We call S is unsplittable, if there do not exist g in S and x,y ∈ G such that g=x+y and Sg-1xy is also a minimal zero-sum sequence. In this paper we show that if S is an unsplittable minimal zero-sum sequence of length |S|= p-12, then S=gp-112(p+32g)4(p-12g) or gp-72(p+52g)2(p-32g). Furthermore, if S is a minimal zero-sum sequence with |S| p-12, then ∈d(S) ≤ 2.

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.

Discussion (0)

Sign in to join the discussion.

Loading comments…