k-fold Sidon sets

Abstract: Let

k g e q 1

be an integer. A set

A s u b s e t m a t h b b Z

is a

k

-fold Sidon set if

A

has only trivial solutions to each equation of the form

c_{1} x_{1} + c_{2} x_{2} + c_{3} x_{3} + c_{4} x_{4} = 0

where

0 l e q | c_{i} | l e q k

, and

c_{1} + c_{2} + c_{3} + c_{4} = 0

. We prove that for any integer

k g e q 1

, a

k

-fold Sidon set

A s u b s e t [N]

has at most

(N / k)^{1 / 2} + O ((N k)^{1 / 4})

elements. Indeed we prove that given any

k

positive integers

c_{1} < c d o t s < c_{k}

, any set

A s u b s e t [N]

that contains only trivial solutions to

c_{i} (x_{1} - x_{2}) = c_{j} (x_{3} - x_{4})

for each

1 l e i l e j l e k

, has at most

(N / k)^{1 / 2} + O ((c_{k}^{2} N / k)^{1 / 4})

elements. On the other hand, for any

k g e q 2

we can exhibit

k

positive integers

c_{1}, d o t s, c_{k}

and a set

A s u b s e t [N]

with

| A | g e (f r a c 1 k + o (1)) N^{1 / 2}

, such that

A

has only trivial solutions to

c_{i} (x_{1} - x_{2}) = c_{j} (x_{3} - x_{4})

for each

1 l e i l e j l e k

.

Full work available at URL: https://arxiv.org/abs/1310.5374

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Recommendations

Cites Work

Cited In (8)

This page was built for publication: \(k\)-fold Sidon sets