Avoiding zero-sum subsequences of prescribed length over the integers

From MaRDI portal



Abstract: Let t and k be a positive integers, and let Ik=iinmathbbZ:;−kleqileqk. Let mathsfs't(Ik) be the smallest positive integer ell such that every zero-sum sequence S over Ik of length |S|geell contains a zero-sum subsequence of length t. If no such ell exists, then let mathsfs't(Ik)=infty. In this paper, we prove that mathsfs't(Ik) is finite if and only if every integer in [1,D(Ik)] divides t, where D(Ik)=max2,2k−1 is the Davenport constant of Ik. Moreover, we prove that if mathsfs't(Ik) is finite, then t+k(k−1)leqmathsfs't(Ik)leqt+(2k−2)(2k−3). We also show that mathsfs't(Ik)=t+k(k−1) holds for kleq3 and conjecture that this equality holds for any kgeq1.












This page was built for publication: Avoiding zero-sum subsequences of prescribed length over the integers

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