Hostname: page-component-77f85d65b8-pztms Total loading time: 0 Render date: 2026-04-21T06:29:39.277Z Has data issue: false hasContentIssue false

k-Sums in Abelian Groups

Published online by Cambridge University Press:  23 April 2012

BENJAMIN GIRARD
Affiliation:
IMJ, Équipe Combinatoire et Optimisation, Université Pierre et Marie Curie (Paris 6), 4 Place Jussieu, 75005 Paris, France (e-mail: bgirard@math.jussieu.fr)
SIMON GRIFFITHS
Affiliation:
IMPA, Estrada Dona Castorina 110, Rio de Janeiro, Brasil 22460-320 (e-mail: sgriff@impa.br)

Abstract

Given a finite subset A of an abelian group G, we study the set kA of all sums of k distinct elements of A. In this paper, we prove that |kA| ≥ |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 AG for which |kA| = |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.

Information

Type
Paper
Copyright
Copyright © Cambridge University Press 2012

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable