Correct order on some certain weighted representation functions

Abstract: Let

m a t h b b N

be the set of all nonnegative integers. For any positive integer

k

and any subset

A

of nonnegative integers, let

r_{1, k} (A, n)

be the number of solutions

(a_{1}, a_{2})

to the equation

n = a_{1} + k a_{2}

. In 2016, Qu proved that

liminf_{n ightarrowinfty}r_{1,k}(A,n)=infty

providing that

r_{1, k} (A, n) = r_{1, k} (m a t h b b N s e t m i n u s A, n)

for all sufficiently large integers, which answered affirmatively a 2012 problem of Yang and Chen. In a very recent article, another Chen (the first named author) slightly improved Qu's result and obtained that

liminf_{n ightarrowinfty}frac{r_{1,k}(A,n)}{log n}>0.

In this note, we further improve the lower bound on

r_{1, k} (A, n)

by showing that

liminf_{n ightarrowinfty}frac{r_{1,k}(A,n)}{n}>0.

Our bound reflects the correct order of magnitude of the representation function

r_{1, k} (A, n)

under the above restrictions due to the trivial fact that

r_{1, k} (A, n) l e n / k .

Recommendations

Cited in

(1)

Unique representations of integers by linear forms

This page was built for publication: Correct order on some certain weighted representation functions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6441956)