{"title":"A footnote to a theorem of Halász","authors":"'Eric Saias, K. Seip","doi":"10.7169/facm/1847","DOIUrl":null,"url":null,"abstract":"A BSTRACT . We study multiplicative functions f satisfying | f ( n ) | ≤ 1 for all n , the associated Dirichlet series F ( s ) : = P ∞ n = 1 f ( n ) n − s , and the summatory function S f ( x ) : = P n ≤ x f ( n ) . Up to a possible trivial contribution from the numbers f (2 k ) , F ( s ) may have at most one zero or one pole on the one-line, in a sense made precise by Halász. We estimate log F ( s ) away from any such point and show that if F ( s ) has a zero on the one-line in the sense of Halász, then | S f ( x ) | ≤ ( x /log x )exp ¡ c p loglog x ¢ for all c > 0 when x is large enough. This bound is best possible.","PeriodicalId":44655,"journal":{"name":"FUNCTIONES ET APPROXIMATIO COMMENTARII MATHEMATICI","volume":null,"pages":null},"PeriodicalIF":0.5000,"publicationDate":"2019-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"FUNCTIONES ET APPROXIMATIO COMMENTARII MATHEMATICI","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.7169/facm/1847","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 0
Abstract
A BSTRACT . We study multiplicative functions f satisfying | f ( n ) | ≤ 1 for all n , the associated Dirichlet series F ( s ) : = P ∞ n = 1 f ( n ) n − s , and the summatory function S f ( x ) : = P n ≤ x f ( n ) . Up to a possible trivial contribution from the numbers f (2 k ) , F ( s ) may have at most one zero or one pole on the one-line, in a sense made precise by Halász. We estimate log F ( s ) away from any such point and show that if F ( s ) has a zero on the one-line in the sense of Halász, then | S f ( x ) | ≤ ( x /log x )exp ¡ c p loglog x ¢ for all c > 0 when x is large enough. This bound is best possible.
摘要。我们研究了所有n满足|f(n)|≤1的乘性函数f,相关的Dirichlet级数f(s):=P∞n=1f(n,n−s,以及求和函数Sf(x):=Pn≤xf(n)。在Halász精确指出的意义上,在数字f(2k)的可能微不足道的贡献下,f(s)在一条线上最多可能有一个零或一个极点。我们估计了远离任何这样的点的log F(s),并证明如果F(s)在Halász意义上的一条线上有一个零,那么当x足够大时,|SF(x)|≤(x/logx)expéc p loglog x¢对于所有c>0。这个界限是最好的可能。