English

A Lower Bound for the Size of a Sum of Dilates

Number Theory 2011-03-16 v2 Combinatorics

Abstract

Let AA be a subset of integers and let 2A+kA={2a1+ka2:a1,a2A}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 2A+kA(k+2)Ak2k+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.

Keywords

Cite

@article{arxiv.1101.5425,
  title  = {A Lower Bound for the Size of a Sum of Dilates},
  author = {Zeljka Ljujic},
  journal= {arXiv preprint arXiv:1101.5425},
  year   = {2011}
}

Comments

v2 Case $k=pq$ added