English

Avoiding zero-sum subsequences of prescribed length over the integers

Combinatorics 2016-12-02 v3

Abstract

Let tt and kk be a positive integers, and let Ik={iZ:  kik}I_k=\{i\in \mathbb{Z}:\; -k\leq i\leq k\}. Let st(Ik)\mathsf{s}'_t(I_k) be the smallest positive integer \ell such that every zero-sum sequence SS over IkI_k of length S|S|\ge \ell contains a zero-sum subsequence of length tt. If no such \ell exists, then let st(Ik)=\mathsf{s}'_t(I_k)=\infty. In this paper, we prove that st(Ik)\mathsf{s}'_t(I_k) is finite if and only if every integer in [1,D(Ik)][1,D(I_k)] divides tt, where D(Ik)=max{2,2k1}D(I_k)=\max\{2,2k-1\} is the Davenport constant of IkI_k. Moreover, we prove that if st(Ik)\mathsf{s}'_t(I_k) is finite, then t+k(k1)st(Ik)t+(2k2)(2k3)t+k(k-1)\leq \mathsf{s}'_t(I_k)\leq t+(2k-2)(2k-3). We also show that st(Ik)=t+k(k1)\mathsf{s}'_t(I_k)=t+k(k-1) holds for k3k\leq 3 and conjecture that this equality holds for any k1k\geq1.

Keywords

Cite

@article{arxiv.1603.03978,
  title  = {Avoiding zero-sum subsequences of prescribed length over the integers},
  author = {C. Augspurger and M. Minter and K. Shoukry and P. Sissokho and K. Voss},
  journal= {arXiv preprint arXiv:1603.03978},
  year   = {2016}
}

Comments

13 pages. Added a new reference, corrected typos in the proof of Lemma 13, and added more details to the proof of Theorem 5

R2 v1 2026-06-22T13:09:38.096Z