Treffer: On a combinatorial problem of Erdős, Kleitman and Lemke

Title:
On a combinatorial problem of Erdős, Kleitman and Lemke
Authors:
Contributors:
Girard, Benjamin
Source:
Advances in Mathematics. 231:1843-1857
Publication Status:
Preprint
Publisher Information:
Elsevier BV, 2012.
Publication Year:
2012
Document Type:
Fachzeitschrift Article
File Description:
application/xml; application/pdf
Language:
English
ISSN:
0001-8708
DOI:
10.1016/j.aim.2012.06.025
DOI:
10.48550/arxiv.1010.5042
Rights:
Elsevier Non-Commercial
arXiv Non-Exclusive Distribution
Accession Number:
edsair.doi.dedup.....ef7e6c23e924c32c1bf9acee7e734964
Database:
OpenAIRE

Weitere Informationen

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