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

From MaRDI portal
Publication:740932

DOI10.1016/J.JNT.2013.06.008zbMATH Open1364.11035arXiv1401.8021OpenAlexW1978180153MaRDI QIDQ740932FDOQ740932

Caixia Shen, Limeng Xia

Publication date: 9 September 2014

Published in: Journal of Number Theory (Search for Journal in Brave)

Abstract: Let G be a finite cyclic group. Every sequence S over G can be written in the form S=(n1g)cdot...cdot(nkg) where ginG and n1,cdots,nkin[1,hboxmord(g)], and the index indS of S is defined to be the minimum of (n1+cdots+nk)/hboxmord(g) over all possible ginG such that langlegangle=G. A conjecture says that if G is finite such that gcd(|G|,6)=1, then ind(S)=1 for every minimal zero-sum sequence S. In this paper, we prove that the conjecture holds if |G| has two prime factors.


Full work available at URL: https://arxiv.org/abs/1401.8021




Recommendations




Cites Work


Cited In (13)





This page was built for publication: Minimal zero-sum sequences of length four over cyclic group with order \(n = p^{\alpha} q^{\beta}\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q740932)