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)=2k−1\ell(k)=2k-1 for k>1k>1.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.