Hostname: page-component-74656f9884-npj9w Total loading time: 0 Render date: 2026-11-08T14:27:16.330Z 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)
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

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.

Information

Type
Paper
Copyright
Copyright © Cambridge University Press 2012