Papers
Topics
Authors
Recent
Search
2000 character limit reached

A Shiu Theorem for Larger and Smoother Functions

Published 24 Aug 2025 in math.NT | (2508.17217v1)

Abstract: In this paper, we broaden Shiu's Brun-Titchmarsh theorem to allow for functions that are larger and/or smooth-supported. In particular, let ff be a nonnegative multiplicative function. We prove that if there exists a $\beta&lt;1$ such that f(p<sup>l)</sup>(loglogx)<sup>lβf(p<sup>l)\ll</sup> (\log\log x)<sup>{l\beta} for every prime pp and every $l&gt;1$, and if f(n)maxn<sup>ϵ,(log</sup>x)<sup>ϵf(n)\ll \max{n<sup>\epsilon,(\log</sup> x)<sup>\epsilon} for every $\epsilon&gt;0$, then xnx+y na(modk)f(n)xϕ(k)(logx)<sup>1ϵ0exp(p</sup>x pkf(p)p)\sum_{\substack{x\leq n\leq x+y \ n\equiv a\pmod k}}f(n)\ll \frac{x}{\phi(k)(\log x)<sup>{1-\epsilon_0}}\exp\left(\sum_{\substack{p\leq</sup> x \ p\nmid k}}\frac{f(p)}{p}\right) for every $\epsilon_0&gt;0$, where xx, yy, and kk are as they were in Shiu's original paper and (a,k)=1(a,k)=1. Moreover, we prove that if ff is a QQ-smooth-supported function then there exists a constant CC for which xnx+y na(modk)f(n)xϕ(k)(logx)<sup>1ϵ0exp(p</sup>x pkf(p)p)ρ(u)<sup>C,\sum_{\substack{x\leq n\leq x+y \ n\equiv a\pmod k}}f(n)\ll \frac{x}{\phi(k)(\log x)<sup>{1-\epsilon_0}}\exp\left(\sum_{\substack{p\leq</sup> x \ p\nmid k}}\frac{f(p)}{p}\right)\rho(u)<sup>C, where u=logxlogQu=\frac{\log x}{\log Q}, ρ\rho is the Dickman-de Bruijn function, and CC depends on whether we choose the bound of f(p<sup>l)</sup>A1<sup>lf(p<sup>l)\leq</sup> A_1<sup>l or f(p<sup>l)</sup>(loglogx)<sup>lβf(p<sup>l)\ll</sup> (\log\log x)<sup>{l\beta}. We also give applications to both the divisor function to large powers and to smooth numbers in short intervals.

Authors (1)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Tweets

Sign up for free to view the 1 tweet with 0 likes about this paper.