Avoiding zero-sum subsequences of prescribed length over the integers
Abstract
Let t and k be a positive integers, and let Ik=\i∈ Z:\; -k≤ i≤ k\. Let s't(Ik) be the smallest positive integer such that every zero-sum sequence S over Ik of length |S| contains a zero-sum subsequence of length t. If no such exists, then let s't(Ik)=∞. In this paper, we prove that s't(Ik) is finite if and only if every integer in [1,D(Ik)] divides t, where D(Ik)=\2,2k-1\ is the Davenport constant of Ik. Moreover, we prove that if s't(Ik) is finite, then t+k(k-1)≤ s't(Ik)≤ t+(2k-2)(2k-3). We also show that s't(Ik)=t+k(k-1) holds for k≤ 3 and conjecture that this equality holds for any k≥1.
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.