Skip to main content
Log in

On Small Sumsets in (ℤ/2ℤ)n

  • Original Paper
  • Published:
Combinatorica Aims and scope Submit manuscript

It is proved that any subset \( {\user1{A}} \) of (ℤ/2ℤ)n, having k elements, such that \( {\left| {{\user1{A}} + {\user1{A}}} \right|} = c{\left| {\user1{A}} \right|} \) (with c<4), is contained in a subgroup of order at most u −1k where u=u(c)>0 is an explicit function of c which does not depend on k nor on n. This improves by a radically different method the corresponding bounds deduced from a more general result of I. Z. Ruzsa.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Jean-Marc Deshouillers.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Deshouillers, JM., Hennecart, F. & Plagne, A. On Small Sumsets in (ℤ/2ℤ)n . Combinatorica 24, 53–68 (2004). https://doi.org/10.1007/s00493-004-0004-0

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00493-004-0004-0

Mathematics Subject Classification (2000):

Navigation