A Lower Bound for the Size of a Sum of Dilates

preprint2011arXivOpen access

Abstract

Let AA be a subset of integers and let 2⋅A+k⋅A={2a1+ka2:a1,a2∈A}2\cdot A+k\cdot A=\{2a_1+ka_2 : a_1,a_2\in A\}. Y. O. Hamidoune and J. Ru\' e proved that if kk is an odd prime and AA a finite set of integers such that ∣A∣>8kk|A|>8k^k, then ∣2⋅A+k⋅A∣≥(k+2)∣A∣−k2−k+2|2\cdot A+k\cdot A|\ge (k+2)|A|-k^2-k+2. In this paper, we extend this result for the case when kk is a power of an odd prime and the case when kk is a product of two odd primes.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.