A note on the lower bound of representation functions

Abstract: For a set

A

of nonnegative integers, let

R_{2} (A, n)

denote the number of solutions to

n = a + a^{'}

with

a, a^{'} i n A

,

a < a^{'}

. Let

A_{0}

be the Thue-Morse sequence and

B_{0} = m a t h b b N s e t m i n u s A_{0}

. Let

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

and

N

be a positive integer such that

R_{2} (A, n) = R_{2} (m a t h b b N s e t m i n u s A, n)

for all

n g e q 2 N - 1

. Previously, the first author proved that if

| A c a p A_{0} | = + i n f t y

and

| A c a p B_{0} | = + i n f t y

, then

R_{2} (A, n) g e q f r a c n + 3 56 N - 52 - 1

for all

n g e q 1

. In this paper, we prove that the above lower bound is nearly best possible. We also get some other results.

Recommendations

Cites work

Cited in

(4)

This page was built for publication: A note on the lower bound of representation functions