A Lower Bound for the Size of a Sum of Dilates

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

2011-01-28

arxiv.org/abs/1101.5425v2

Mathematics

Number Theory

v2 Case $k=pq$ added

Scientific paper

Let $A$ be a subset of integers and let $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 $k$ is an odd prime and $A$ a finite set of integers such that $|A|>8k^k$, then $|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 $k$ is a power of an odd prime and the case when $k$ is a product of two odd primes.

Affiliated with

Also associated with

No associations

Rating

A Lower Bound for the Size of a Sum of Dilates does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A Lower Bound for the Size of a Sum of Dilates, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Lower Bound for the Size of a Sum of Dilates will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-550710