Hostname: page-component-7b7567c8c-wxvwp Total loading time: 0 Render date: 2026-11-15T21:48:55.217Z Has data issue: false hasContentIssue false

A Lower Bound for the Size of a Minkowski Sum of Dilates

Published online by Cambridge University Press:  06 December 2010

Y. O. HAMIDOUNE
Affiliation:
UPMC, Université Paris 06, 4 Place Jussieu, 75005 Paris, France (e-mail: hamidoune@math.jussieu.fr)
J. RUÉ
Affiliation:
LIX, École Polytechnique, 91128 Palaiseau-CEDEX, France (e-mail: rue1982@lix.polytechnique.fr)
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.

Let A be a finite non-empty set of integers. An asymptotic estimate of the size of the sum of several dilates was obtained by Bukh. The unique known exact bound concerns the sum |A + k⋅A|, where k is a prime and |A| is large. In its full generality, this bound is due to Cilleruelo, Serra and the first author.

Let k be an odd prime and assume that |A| > 8kk. A corollary to our main result states that |2⋅A + k⋅A|≥(k+2)|A|−k2−k+2. Notice that |2⋅P+k⋅P|=(k+2)|P|−2k, if P is an arithmetic progression.

Information

Type
Paper
Copyright
Copyright © Cambridge University Press 2010