A zero-sum theorem over Z

Abstract

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

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…