On a combinatorial problem of Erdos, Kleitman and Lemke

TL;DR

This paper investigates a combinatorial problem related to a conjecture by Erdos and Lemke, focusing on subsequences summing to n within sequences of divisors, and establishes a new upper bound for a related zero-sum invariant in finite Abelian groups.

Contribution

It provides a new upper bound for a zero-sum invariant in finite Abelian groups, clarifying its order of magnitude and extending previous results.

Findings

Established a new upper bound for the zero-sum invariant.

Determined the correct order of magnitude for the invariant.

Extended earlier combinatorial and algebraic results.

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.