Skip to main content
×
Home
    • Aa
    • Aa

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

  • Y. O. HAMIDOUNE (a1) and J. RUÉ (a2)
Abstract

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 + kA|, 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 + kA|≥(k+2)|A|−k2k+2. Notice that |2⋅P+kP|=(k+2)|P|−2k, if P is an arithmetic progression.

Copyright
Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

Combinatorics, Probability and Computing
  • ISSN: 0963-5483
  • EISSN: 1469-2163
  • URL: /core/journals/combinatorics-probability-and-computing
Please enter your name
Please enter a valid email address
Who would you like to send this to? *
×

Metrics

Full text views

Total number of HTML views: 0
Total number of PDF views: 10 *
Loading metrics...

Abstract views

Total abstract views: 73 *
Loading metrics...

* Views captured on Cambridge Core between September 2016 - 25th September 2017. This data will be updated every 24 hours.