Explicit averages of square-free supported functions: to the edge of the convolution method

preprint2020arXivOpen access

Abstract

We give a general statement of the convolution method so that one can provide explicit asymptotic estimations for all averages of square-free supported arithmetic functions that have a sufficiently regular order on the prime numbers and observe how the nature of this method gives error term estimations of order X−δX^{-δ}, where δδ belongs to an open real positive set II. In order to have a better error estimation, a natural question is whether or not we can achieve an error term of critical order X−δ0X^{-δ_0}, where δ0δ_0, the critical exponent, is the right hand endpoint of II. We reply positively to that question by presenting a new method that improves qualitatively almost all instances of the convolution method under some regularity conditions; now, the asymptotic estimation of averages of well-behaved square-free supported arithmetic functions can be given with its critical exponent and a reasonable explicit error constant. We illustrate this new method by analyzing a particular average related to the work of Ramaré--Akhilesh (2017), which leads to notable improvements when imposing non-trivial coprimality conditions.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.