On a combinatorial problem of Erdos, Kleitman and Lemke

Abstract

In this paper, we study a combinatorial problem originating in the following conjecture of Erdos and Lemke: given any sequence of n divisors of n, repetitions being allowed, there exists a subsequence the elements of which are summing to n. This conjecture was proved by Kleitman and Lemke, who then extended the original question to a problem on a zero-sum invariant in the framework of finite Abelian groups. Building among others on earlier works by Alon and Dubiner and by the author, our main theorem gives a new upper bound for this invariant in the general case, and provides its right order of magnitude.

15 pages

References in corpus (4)

• A Survey of Graph Pebbling
• Recent Progress in Graph Pebbling
• An application of graph pebbling to zero-sum sequences in abelian groups
• A new upper bound for the cross number of finite Abelian groups