English

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

Number Theory 2014-01-31 v1

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 gGg\in G and n1,,nl[1,ord(g)]n_1,\cdots,n_l\in[1,{\hbox{\rm ord}}(g)], and the index \ind(S)\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 gGg\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\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|.

Keywords

Cite

@article{arxiv.1401.7979,
  title  = {On the index-conjecture on the length four minimal zero-sum sequences},
  author = {Li-meng Xia},
  journal= {arXiv preprint arXiv:1401.7979},
  year   = {2014}
}

Comments

International Journal of Number Theory (2013). arXiv admin note: text overlap with arXiv:1303.1682, arXiv:1303.1676 by other authors

R2 v1 2026-06-22T02:58:07.329Z