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

preprint2014arXivOpen access

Abstract

Let p>155p > 155 be a prime and let GG be a cyclic group of order pp. Let SS be a minimal zero-sum sequence with elements over GG, i.e., the sum of elements in SS is zero, but no proper nontrivial subsequence of SS has sum zero. We call SS is unsplittable, if there do not exist gg in SS and x,y∈Gx,y \in G such that g=x+yg=x+y and Sg−1xySg^{-1}xy is also a minimal zero-sum sequence. In this paper we show that if SS is an unsplittable minimal zero-sum sequence of length ∣S∣=p−12|S|= \frac{p-1}{2}, then S=gp−112(p+32g)4(p−12g)S=g^{\frac{p-11}{2}}(\frac{p+3}{2}g)^4(\frac{p-1}{2}g) or gp−72(p+52g)2(p−32g)g^{\frac{p-7}{2}}(\frac{p+5}{2}g)^2(\frac{p-3}{2}g). Furthermore, if SS is a minimal zero-sum sequence with ∣S∣≥p−12|S| \ge \frac{p-1}{2}, then $\ind(S) \leq 2$.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.