English

Minimal zero-sum sequences of length four over cyclic group with order $n=p^\alpha q^\beta$

Number Theory 2014-02-03 v1

Abstract

Let GG be a finite cyclic group. Every sequence SS over GG can be written in the form S=(n1g)...(nkg)S=(n_1g)\cdot...\cdot(n_kg) where gGg\in G and n1,,nk[1,ord(g)]n_1,\cdots,n_k\in[1,{\hbox{\rm ord}}(g)], and the index \indS\ind S of SS is defined to be the minimum of (n1++nk)/ord(g)(n_1+\cdots+n_k)/\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 G|G| has two prime factors.

Keywords

Cite

@article{arxiv.1401.8021,
  title  = {Minimal zero-sum sequences of length four over cyclic group with order $n=p^\alpha q^\beta$},
  author = {Li-meng Xia and Caixia Shen},
  journal= {arXiv preprint arXiv:1401.8021},
  year   = {2014}
}

Comments

Journal of Number Theory (2013). arXiv admin note: text overlap with arXiv:1303.1682, arXiv:1303.1676, arXiv:1401.7981, arXiv:1401.7979