2000 character limit reached
Large sieve inequalities with power moduli and Waring's problem
Published 14 Mar 2023 in math.NT | (2303.07613v2)
Abstract: We improve the large sieve inequality with $k$th-power moduli, for all $k\ge 4$. Our method relates these inequalities to a restricted variant of Waring's problem. Firstly, we input a classical divisor bound on the number of representations of a positive integer as a sum of two $k$th-powers. Secondly, we input a recent and general result of Wooley on mean values of exponential sums. Lastly, we state a conditional result, based on the conjectural Hardy-Littlewood formula for the number of representations of a large positive integer as a sum of $k+1$ $k$th-powers.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.