Article contents
k-Sums in Abelian Groups
Published online by Cambridge University Press: 23 April 2012
Abstract
Given a finite subset A of an abelian group G, we study the set k ∧ A of all sums of k distinct elements of A. In this paper, we prove that |k ∧ A| ≥ |A| for all k ∈ {2,. . .,|A| − 2}, unless k ∈ {2, |A| − 2} and A is a coset of an elementary 2-subgroup of G. Furthermore, we characterize those finite sets A ⊆ G for which |k ∧ A| = |A| for some k ∈ {2,. . .,|A| − 2}. This result answers a question of Diderrich. Our proof relies on an elementary property of proper edge-colourings of the complete graph.
Keywords
- Type
- Paper
- Information
- Copyright
- Copyright © Cambridge University Press 2012
References
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20552:20160408050450325-0108:S0963548312000168_char1.gif?pub-status=live)
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20552:20160408050450325-0108:S0963548312000168_char1.gif?pub-status=live)
- 4
- Cited by