English

A zero-sum theorem over Z

Combinatorics 2012-12-13 v1

Abstract

A zero-sum sequence of integers is a sequence of nonzero terms that sum to 0. Let k>0k>0 be an integer and let [k,k][-k,k] denote the set of all nonzero integers between k-k and kk. Let (k)\ell(k) be the smallest integer \ell such that any zero-sum sequence with elements from [k,k][-k,k] and length greater than \ell contains a proper nonempty zero-sum subsequence. In this paper, we prove a more general result which implies that (k)=2k1\ell(k)=2k-1 for k>1k>1.

Keywords

Cite

@article{arxiv.1212.2690,
  title  = {A zero-sum theorem over Z},
  author = {Marvin Sahs and Papa Sissokho and Jordan Torf},
  journal= {arXiv preprint arXiv:1212.2690},
  year   = {2012}
}

Comments

11 papes

R2 v1 2026-06-21T22:52:56.270Z