On the index-conjecture on the length four minimal zero-sum sequences

preprint2014arXivOpen access

Abstract

Let GG be a finite cyclic group. Every sequence SS over GG can be written in the form S=(n1g)⋅...⋅(nlg)S=(n_1g)\cdot...\cdot(n_lg) where g∈Gg\in G and n1,⋯ ,nl∈[1,ord(g)]n_1,\cdots,n_l\in[1,{\hbox{\rm ord}}(g)], and the index $\ind(S)$ of SS is defined to be the minimum of (n1+⋯+nl)/ord(g)(n_1+\cdots+n_l)/\hbox{\rm ord}(g) over all possible g∈Gg\in G such that ⟨g⟩=G\langle g\rangle=G. A conjecture says that if GG is finite such that gcd⁡(∣G∣,6)=1\gcd(|G|,6)=1, then $\ind(S)=1$ for every minimal zero-sum sequence SS. In this paper, we prove that the conjecture holds if SS is reduced and at least one nin_i coprime to ∣G∣|G|.

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.