A note on product sets of random sets

Abstract: Given two sets of positive integers

A

and

B

, let

A B := a b : a i n A,, b i n B

be their product set and put

A^{k} := A c d o t s A

(

k

times

A

) for any positive integer

k

. Moreover, for every positive integer

n

and every

a l p h a i n [0, 1]

, let

m a t h c a l B (n, a l p h a)

denote the probabilistic model in which a random set

A s u b s e t e q 1, d o t s, n

is constructed by choosing independently every element of

1, d o t s, n

with probability

a l p h a

. We prove that if

A_{1}, d o t s, A_{s}

are random sets in

m a t h c a l B (n_{1}, a l p h a_{1}), d o t s, m a t h c a l B (n_{s}, a l p h a_{s})

, respectively,

k_{1}, d o t s, k_{s}

are fixed positive integers,

a l p h a_{i} n_{i} o + i n f t y

, and

1 / a l p h a_{i}

does not grow too fast in terms of a product of

l o g n_{j}

; then

| A_{1}^{k_{1}} c d o t s A_{s}^{k_{s}} | s i m f r a c | A_{1} |^{k_{1}} k_{1}! c d o t s f r a c | A_{s} |^{k_{s}} k_{s}!

with probability

1 - o (1)

. This is a generalization of a result of Cilleruelo, Ramana, and Ramar'e, who considered the case

s = 1

and

k_{1} = 2

.

Recommendations

Cites work

Cited in

(9)

This page was built for publication: A note on product sets of random sets