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

From MaRDI portal
Publication:456784

DOI10.1016/J.AIM.2012.06.025zbMATH Open1251.05178arXiv1010.5042OpenAlexW2069050668MaRDI QIDQ456784FDOQ456784


Authors: Benjamin Girard Edit this on Wikidata


Publication date: 16 October 2012

Published in: Advances in Mathematics (Search for Journal in Brave)

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.


Full work available at URL: https://arxiv.org/abs/1010.5042




Recommendations




Cites Work


Cited In (10)





This page was built for publication: On a combinatorial problem of Erdős, Kleitman and Lemke

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q456784)