This paper was converted on www.awesomepapers.org from LaTeX by an anonymous user.
Want to know more? Visit the Converter page.

Oscillations in weighted arithmetic sums

Michael J. Mossinghoff Center for Communications Research
Princeton, NJ, USA
[email protected]
 and  Timothy S. Trudgian School of Science
UNSW Canberra at ADFA
ACT 2610, Australia
[email protected]
Abstract.

We examine oscillations in a number of sums of arithmetic functions involving Ω(n)\Omega(n), the total number of prime factors of nn, and ω(n)\omega(n), the number of distinct prime factors of nn. In particular, we examine oscillations in Sα(x)=nx(1)nΩ(n)/nαS_{\alpha}(x)=\sum_{n\leq x}(-1)^{n-\Omega(n)}/n^{\alpha} and in Hα(x)=nx(1)ω(n)/nαH_{\alpha}(x)=\sum_{n\leq x}(-1)^{\omega(n)}/n^{\alpha} for α[0,1]\alpha\in[0,1], and in W(x)=nx(2)Ω(n)W(x)=\sum_{n\leq x}(-2)^{\Omega(n)}. We show for example that each of the inequalities S0(x)<0S_{0}(x)<0, S0(x)>3.3xS_{0}(x)>3.3\sqrt{x}, S1(x)>0S_{1}(x)>0, and S1(x)x<3.3S_{1}(x)\sqrt{x}<-3.3 is true infinitely often, disproving some hypotheses of Sun.

Key words and phrases:
Prime-counting functions, Liouville function, oscillations, Riemann hypothesis
2010 Mathematics Subject Classification:
Primary: 11M26, 11N64; Secondary: 11Y35, 11Y70
This work was supported by a Future Fellowship (FT160100094 to T. S. Trudgian) from the Australian Research Council.

1. Introduction

Let ω(n)\omega(n) denote the number of distinct prime factors of nn, and let Ω(n)\Omega(n) denote its total number of prime factors, counting multiplicity. Questions involving the parity of these functions have a long history. For α[0,1]\alpha\in[0,1], define

Lα(x)=nx(1)Ω(n)nαL_{\alpha}(x)=\sum_{n\leq x}\frac{(-1)^{\Omega(n)}}{n^{\alpha}} (1.1)

and

Hα(x)=nx(1)ω(n)nα.H_{\alpha}(x)=\sum_{n\leq x}\frac{(-1)^{\omega(n)}}{n^{\alpha}}. (1.2)

Pólya studied L0(x)L_{0}(x) in his 1919 article [23]. He noted that L0(x)L_{0}(x) was not positive after L0(1)=1L_{0}(1)=1 up to approximately x=1500x=1500, and remarked that the Riemann hypothesis, as well as the simplicity of the zeros of the zeta function, would follow if this held true for all sufficiently large xx. More generally, it is well known that both of these statements would hold if the normalized function L0(x)/xL_{0}(x)/\sqrt{x} were bounded by some constant, either above or below. In his influential 1942 paper [14], Ingham showed that considerably more would follow in this case: there would exist infinitely many linear dependencies over the rationals among the ordinates of the zeros of the zeta function on the critical line in the upper half plane. Stated another way, if the (positive) ordinates of the nontrivial zeros of ζ(s)\zeta(s) are linearly independent, then arbitrarily large oscillations must exist in L0(x)/xL_{0}(x)/\sqrt{x}. In fact, Ingham showed that this holds both for Pólya’s function L0(x)L_{0}(x) and for its close cousin, the Mertens function,

M(x)=nxμ(n).M(x)=\sum_{n\leq x}\mu(n). (1.3)

Since it seems there is no a priori reason to suspect such linear dependencies, and none has ever been detected among the zeros of the zeta function, it is often conjectured that these functions exhibit unbounded oscillations. Large oscillations have been shown to exist in the Mertens function [4, 13] and in the error term for the distribution of kk-free numbers [19].

Turán studied L1(x)L_{1}(x) in 1948 [25], where he reported that this function is never negative over 2x10002\leq x\leq 1000, and connected its behavior to the zeros of the Riemann zeta function. Here, the Riemann hypothesis, as well as the simplicity of the zeros and the existence of linear dependencies among their ordinates, would similarly follow if L1(x)xL_{1}(x)\sqrt{x} were bounded either above or below. Haselgrove [11] established that infinitely many sign changes in both L0(x)L_{0}(x) and L1(x)L_{1}(x) exist. Specific locations of sign changes in these functions were first determined respectively in [16] and in [6].

The broader family Lα(x)L_{\alpha}(x) was investigated in [20], where the authors established how these functions are connected to the Riemann hypothesis, as well as the statement on the simplicity of the zeros of ζ(s)\zeta(s) and the question of linear independence. In [21] it was shown that substantial oscillations must exist in the normalized functions Lα(x)x12αL_{\alpha}(x)x^{\frac{1}{2}-\alpha}. For example, it was shown that each of the inequalities L0(x)/x>1L_{0}(x)/\sqrt{x}>1 and L1(x)x>2.37L_{1}(x)\sqrt{x}>2.37 holds for infinitely many integers xx (see [21, Thms. 1.1 and 6.2]). The reader is referred to [6, 12, 20, 21] for additional information and background on this family of functions.

In [22], the authors established similar connections and statements for the function H0(x)H_{0}(x). Here, among other things, it was established that each of the inequalities H0(x)/x>1.7H_{0}(x)/\sqrt{x}>1.7 and H0(x)/x<1.7H_{0}(x)/\sqrt{x}<-1.7 holds for infinitely many positive integers xx.

In [24, Conj. 1.1], Sun hypothesized that both L1(x)L_{1}(x) and H1(x)H_{1}(x) are Oϵ(x12+ϵ)O_{\epsilon}(x^{-\frac{1}{2}+\epsilon}) for any ϵ>0\epsilon>0. Both of these statements seem likely to be true, since either of these is equivalent to the Riemann hypothesis (see also [5, 20]). Sun also remarked there that H1(x)H_{1}(x) may be O(x12)O(x^{-\frac{1}{2}}), but by the same argument employed in [21, §5] for H0(x)/xH_{0}(x)/\sqrt{x}, bounding H1(x)xH_{1}(x)\sqrt{x} would again imply the existence of infinitely many linear dependence relations among the ordinates of the zeros of the zeta function in the upper half plane, so a bound of this strength seems doubtful.

In this paper, we prove that large oscillations must exist in Hα(x)xα12H_{\alpha}(x)x^{\alpha-\frac{1}{2}} for every α[0,1]\alpha\in[0,1]. This presents an ω\omega-complement to the Ω\Omega work of [20] and [21], and generalizes the oscillation result concerning the case α=0\alpha=0 from [22] in a natural way. For σ>1\sigma>1 and s=σ+its=\sigma+it, let h(s)h(s) denote the Dirichlet series

h(s)=n1(1)ω(n)ns=p(1k11pks)=ζ(s)p(12ps).h(s)=\sum_{n\geq 1}\frac{(-1)^{\omega(n)}}{n^{s}}=\prod_{p}\biggl{(}1-\sum_{k\geq 1}\frac{1}{p^{ks}}\biggr{)}=\zeta(s)\prod_{p}\left(1-\frac{2}{p^{s}}\right). (1.4)

The series h(1)h(1) was investigated by van de Lune and Dressler in 1975 [18], who proved that its value is 0. Following [22, §5], we may write the Euler product above as

h(s)=F6(s)Z6(s),h(s)=\frac{F_{6}(s)}{Z_{6}(s)}, (1.5)

where

F6(s)=p(118p7s30p8s56p9s)F_{6}(s)=\prod_{p}\left(1-\frac{18}{p^{7s}}-\frac{30}{p^{8s}}-\frac{56}{p^{9s}}-\cdots\right)

is an explicitly given function that converges in the half plane σ>1/7\sigma>1/7, and

Z6(s)=ζ(s)ζ(2s)ζ2(3s)ζ3(4s)ζ6(5s)ζ9(6s),Z_{6}(s)=\zeta(s)\zeta(2s)\zeta^{2}(3s)\zeta^{3}(4s)\zeta^{6}(5s)\zeta^{9}(6s),

so that h(s)h(s) can be continued analytically to the left of the σ=1\sigma=1 line. (We remark as in [22] that there is no trouble in extending the form in (1.5) so that the corresponding function Fk(s)F_{k}(s) converges on σ>1/(k+1)\sigma>1/(k+1) for larger values of kk.) For convenience we write h(α)h(\alpha) in place of F6(α)/Z6(α)F_{6}(\alpha)/Z_{6}(\alpha) for α(12,1)\alpha\in(\frac{1}{2},1) throughout. For 0α10\leq\alpha\leq 1, we define a(x)\mathscr{H}_{a}(x) by

a(x)={Hα(x),if 0α12,Hα(x)h(α),if 12<α1.\mathscr{H}_{a}(x)=\begin{cases}H_{\alpha}(x),&\textrm{if $0\leq\alpha\leq\frac{1}{2}$},\\ H_{\alpha}(x)-h(\alpha),&\textrm{if $\frac{1}{2}<\alpha\leq 1$}.\end{cases} (1.6)

We establish the following theorem.

Theorem 1.1.

For each α[0,1]\alpha\in[0,1], each of the following inequalities holds for infinitely many positive integers xx:

α(x)xα12<1.7,α(x)xα12>1.7.\mathscr{H}_{\alpha}(x)x^{\alpha-\frac{1}{2}}<-1.7,\quad\mathscr{H}_{\alpha}(x)x^{\alpha-\frac{1}{2}}>1.7.

Sun made some additional conjectures regarding sums involving Ω(n)\Omega(n) in [24], which we also address here. Let

Sα(x)=nx(1)nΩ(n)nα.S_{\alpha}(x)=\sum_{n\leq x}\frac{(-1)^{n-\Omega(n)}}{n^{\alpha}}. (1.7)

In [24, Hypoth. 1.1], Sun made the following four hypotheses:

S0(x)>0 for x5,\displaystyle S_{0}(x)>0\textrm{\;\ for $x\geq 5$,} (1.8)
S1(x)<0 for x1,\displaystyle S_{1}(x)<0\textrm{\;\ for $x\geq 1$,} (1.9)
1<S0(x)x<2.3 for x325,\displaystyle 1<\frac{S_{0}(x)}{\sqrt{x}}<2.3\textrm{\;\ for $x\geq 325$,} (1.10)
2.3<S1(x)x<1 for x3.\displaystyle-2.3<S_{1}(x)\sqrt{x}<-1\textrm{\;\ for $x\geq 3$.} (1.11)

Certainly (1.10) and (1.11) are stronger than (1.8) and (1.9) respectively for sufficiently large xx, and clearly (1.10) and (1.11) appear related. Sun reported that (1.10) was checked for x1011x\leq 10^{11} and (1.11) for x2109x\leq 2\cdot 10^{9}.

We disprove all four of these statements in this article. In two of the conjectured inequalities above—the lower bounds in (1.10) and (1.11)—we also determine the minimal counterexample, after calculating these functions for x7.51014x\leq 7.5\cdot 10^{14}. We summarize some of the results of our computations in the following theorem.

Theorem 1.2.

The following statements hold for the function Sα(x)S_{\alpha}(x) from (1.7).

  1. (a)

    The smallest integer x325x\geq 325 for which S0(x)xS_{0}(x)\leq\sqrt{x} is x0=702469704523413x_{0}=702469704523413. Here, S0(x0)=26504145S_{0}(x_{0})=26504145, so x0S0(x0)=0.044189\sqrt{x_{0}}-S_{0}(x_{0})=0.044189\ldots .

  2. (b)

    The minimal value of S0(x)/xS_{0}(x)/\sqrt{x} for integers xx with 324x7.51014324\leq x\leq 7.5\cdot 10^{14} is 0.98760.9876\ldots , occurring at x0=702494078543084x_{0}^{*}=702494078543084, and S0(x0)=26175950S_{0}(x_{0}^{*})=26175950.

  3. (c)

    The smallest integer x1x\geq 1 for which S1(x)x2.3S_{1}(x)\sqrt{x}\leq-2.3 is x1=702475225213517x_{1}=702475225213517, at which S1(x1)x1=2.300000012S_{1}(x_{1})\sqrt{x_{1}}=-2.300000012\ldots .

  4. (d)

    The minimal value of S1(x)xS_{1}(x)\sqrt{x} for integers x7.51014x\leq 7.5\cdot 10^{14} occurs at x1=702494078542878x_{1}^{*}=702494078542878, and S1(x1)x1=2.3108948S_{1}(x_{1}^{*})\sqrt{x_{1}^{*}}=-2.3108948\ldots .

In addition, we determine lower bounds on the oscillations exhibited by S0(x)/xS_{0}(x)/\sqrt{x} and S1(x)xS_{1}(x)\sqrt{x}. These results show that each of the conjectured bounds in (1.8), (1.9), (1.10), and (1.11) is violated infinitely often. Our method in fact allows us to determine information on Sα(x)S_{\alpha}(x) for any α[0,1]\alpha\in[0,1]. For this, we define

𝒮α(x)={Sα(x),if 0α<1/2 or α=1,Sα(x)+1+22ζ(1/2)logx,if α=1/2,Sα(x)+(1+2α)ζ(2α)ζ(α),if 1/2<α<1.\mathscr{S}_{\alpha}(x)=\begin{cases}\displaystyle S_{\alpha}(x),&\textrm{if $0\leq\alpha<1/2$ or $\alpha=1$},\\ \displaystyle S_{\alpha}(x)+\frac{1+\sqrt{2}}{2\zeta(1/2)}\log x,&\textrm{if $\alpha=1/2$},\\[8.0pt] \displaystyle S_{\alpha}(x)+\frac{(1+2^{-\alpha})\zeta(2\alpha)}{\zeta(\alpha)},&\textrm{if $1/2<\alpha<1$.}\end{cases} (1.12)

We determine bounds on oscillations for 𝒮α(x)\mathscr{S}_{\alpha}(x) for all α[0,1]\alpha\in[0,1] in the following theorem.

Theorem 1.3.

For each α[0,1/2)(1/2,1]\alpha\in[0,1/2)\cup(1/2,1], each of the following inequalities is satisfied for infinitely many positive integers xx:

𝒮α(x)xα12<1+2(2α1)ζ(1/2)1.6725193,𝒮α(x)xα12>1+2(2α1)ζ(1/2)+1.6725193.\begin{split}\mathscr{S}_{\alpha}(x)x^{\alpha-\frac{1}{2}}&<\frac{1+\sqrt{2}}{(2\alpha-1)\zeta(1/2)}-1.6725193,\\ \mathscr{S}_{\alpha}(x)x^{\alpha-\frac{1}{2}}&>\frac{1+\sqrt{2}}{(2\alpha-1)\zeta(1/2)}+1.6725193.\end{split} (1.13)

In particular, each of the following holds for infinitely many positive integers xx:

𝒮0(x)x1/2<0.019349,𝒮0(x)x1/2>3.32568,𝒮1/4(x)x1/4<1.63369,𝒮1/4(x)x1/4>4.97900,𝒮3/4(x)x1/4<4.97900,𝒮3/4(x)x1/4>1.63369,𝒮1(x)x1/2<3.32568,𝒮1(x)x1/2>0.019349.\begin{split}\mathscr{S}_{0}(x)x^{-1/2}<-0.019349,&\quad\mathscr{S}_{0}(x)x^{-1/2}>3.32568,\\ \mathscr{S}_{1/4}(x)x^{-1/4}<1.63369,&\quad\mathscr{S}_{1/4}(x)x^{-1/4}>4.97900,\\ \mathscr{S}_{3/4}(x)x^{1/4}<-4.97900,&\quad\mathscr{S}_{3/4}(x)x^{1/4}>-1.63369,\\ \mathscr{S}_{1}(x)x^{1/2}<-3.32568,&\quad\mathscr{S}_{1}(x)x^{1/2}>0.019349.\end{split} (1.14)

In addition, each of the following inequalities is satisfied for infinitely many positive integers xx:

𝒮1/2(x)<3.27438,𝒮1/2(x)>0.071048.\mathscr{S}_{1/2}(x)<-3.27438,\quad\mathscr{S}_{1/2}(x)>0.071048. (1.15)

In this article we investigate another conjecture made by Sun as well in [24]. Let

W(x)=nx(2)Ω(n).W(x)=\sum_{n\leq x}(-2)^{\Omega(n)}. (1.16)

The similar function W+(x)=nx2Ω(n)W_{+}(x)=\sum_{n\leq x}2^{\Omega(n)} was considered by Grosswald [8] and by Bateman [2]: in particular, Grosswald proved that |W+(x)|xlog2x\left\lvert W_{+}(x)\right\rvert\ll x\log^{2}x. In [24, Conj. 1.1] Sun conjectured that a smaller and explicit bound holds for W(x)W(x):

|W(x)|<x for x3078.\left\lvert W(x)\right\rvert<x\textrm{\;\ for $x\geq 3078$}. (1.17)

We investigate this function here, and verify that (1.17) holds for x2.51014x\leq 2.5\cdot 10^{14}.

This article is organized in the following way. Section 2 describes the notion of weak independence of a set of real numbers, and its use in establishing lower bounds on the oscillation of sums of certain arithmetic functions. Section 3 presents the analysis of the functions Sα(x)S_{\alpha}(x), and establishes Theorem 1.3. Following this, Section 4 considers the family Hα(x)H_{\alpha}(x), and proves Theorem 1.1. Details on the computations that establish Theorem 1.2 and related facts, along with information on calculations for W(x)W(x), are described in Section 5. Finally, in Section 6 we touch on some other conjectures of Sun from [24].

2. Weak independence and oscillations

The work of Grosswald [9, 10], Bateman et al. [3], Diamond [7], Anderson and Stark [1], and others establishes connections between bounding oscillations in sums of certain arithmetic functions and the existence of integral linear relations among the ordinates of nontrivial zeros of ζ(s)\zeta(s), where the linear relations have bounded coefficients. For example, in 1971 Bateman et al. [3] showed that if the Mertens function (1.3) satisfied |M(x)|x\left\lvert M(x)\right\rvert\leq\sqrt{x} for all x>0x>0 then there would exist infinitely many linear relations among the nontrivial zeros of ζ(s)\zeta(s) in the upper half plane with maximum coefficient 22. They showed as well that the ordinates of the first 2020 zeros of ζ(s)\zeta(s) on the critical line are 11-independent, that is, there exist no nontrivial linear relations among these values using coefficients {1,0,1}\{-1,0,1\}. In a more recent study of oscillations in the Mertens function [4], it was shown that the first 500500 zeros of ζ(s)\zeta(s) are 10510^{5}-independent.

Here, in order to exhibit large oscillations in sums we require a particular form of weak linear independence for certain zeros of ζ(s)\zeta(s). We assume the Riemann hypothesis and the simplicity of its zeros here and throughout this paper, as unbounded oscillations would follow anyway if either of these conditions did not hold. Let Γ\Gamma denote a set of positive real numbers, and for T>1T>1 let Γ=Γ(T)\Gamma^{\prime}=\Gamma^{\prime}(T) denote a subset of Γ[0,T]\Gamma\cap[0,T]. For each γΓ\gamma\in\Gamma^{\prime}, let NγN_{\gamma} denote a positive integer. We say Γ\Gamma^{\prime} is {Nγ}\{N_{\gamma}\}-independent in Γ[0,T]\Gamma\cap[0,T] if two conditions hold. First, whenever

γΓcγγ=0, with |cγ|Nγ,cγ,\sum_{\gamma\in\Gamma^{\prime}}c_{\gamma}\gamma=0,\textrm{\;\ with $\left\lvert c_{\gamma}\right\rvert\leq N_{\gamma},\;c_{\gamma}\in\mathbb{Z}$},

then necessarily all cγ=0c_{\gamma}=0. Second, for any γΓ[0,T]\gamma^{*}\in\Gamma\cap[0,T], if

γΓcγγ=γ, with |cγ|Nγ,cγ,\sum_{\gamma\in\Gamma^{\prime}}c_{\gamma}\gamma=\gamma^{*},\textrm{\;\ with $\left\lvert c_{\gamma}\right\rvert\leq N_{\gamma},\;c_{\gamma}\in\mathbb{Z}$},

then γΓ\gamma^{*}\in\Gamma^{\prime}, cγ=1c_{\gamma*}=1, and all other cγ=0c_{\gamma}=0. That is, the only linear relations with small coefficients here are the trivial ones. In addition, if NN is a positive integer with the property that each NγNN_{\gamma}\geq N with {Nγ}\{N_{\gamma}\} as above, then we say that Γ\Gamma^{\prime} is NN-independent in Γ[0,T]\Gamma\cap[0,T].

Anderson and Stark [1] established a means for bounding oscillations by using weak independence. We summarize a particular result of theirs: suppose g(u)g(u) is a piecewise continuous, real function, bounded on finite intervals, with Laplace transform G(s)G(s),

G(s)=0g(u)esu𝑑u.G(s)=\int_{0}^{\infty}g(u)e^{-su}\,du.

Suppose also that G(s)G(s) is absolutely convergent in σ>σ0\sigma>\sigma_{0} for some σ0\sigma_{0}, and can be analytically continued back to σ0\sigma\geq 0, except for simple poles occurring at ±iγ\pm i\gamma for γΓ\gamma\in\Gamma, for a particular set Γ\Gamma of positive real numbers, and possibly a simple pole at 0 as well. If ΓΓ\Gamma^{\prime}\subseteq\Gamma is {Nγ}\{N_{\gamma}\}-independent in Γ[0,T]\Gamma\cap[0,T], then

lim infug(u)Res(G,0)2γΓNγNγ+1kT(γ)|Res(G,iγ)|,lim supug(u)Res(G,0)+2γΓNγNγ+1kT(γ)|Res(G,iγ)|,\begin{split}\liminf_{u\to\infty}g(u)&\leq\operatorname{Res}(G,0)-2\sum_{\gamma\in\Gamma^{\prime}}\frac{N_{\gamma}}{N_{\gamma}+1}k_{T}(\gamma)\left\lvert\operatorname{Res}(G,i\gamma)\right\rvert,\\ \limsup_{u\to\infty}g(u)&\geq\operatorname{Res}(G,0)+2\sum_{\gamma\in\Gamma^{\prime}}\frac{N_{\gamma}}{N_{\gamma}+1}k_{T}(\gamma)\left\lvert\operatorname{Res}(G,i\gamma)\right\rvert,\end{split} (2.1)

where kT(x)k_{T}(x) denotes an admissible weight function, which must be even, nonnegative, supported on [T,T][-T,T], have the value 11 at x=0x=0, and be the Fourier transform of a nonnegative function. While the Fejér kernel (kT(x)=1|x|/Tk_{T}(x)=1-\left\lvert x\right\rvert/T for |x|T\left\lvert x\right\rvert\leq T and 0 otherwise) is admissible, we employ the kernel of Jurkat and Peyerimhoff [15] here, defined by

kT(x)={(1|x|T)cos(πxT)+1πsin(π|x|T),if |x|T,0,if |x|>T.k_{T}(x)=\begin{cases}\displaystyle\left(1-\frac{\left\lvert x\right\rvert}{T}\right)\cos\left(\frac{\pi x}{T}\right)+\frac{1}{\pi}\sin\left(\frac{\pi\left\lvert x\right\rvert}{T}\right),&\textrm{if $\left\lvert x\right\rvert\leq T$},\\ \displaystyle 0,&\textrm{if $\left\lvert x\right\rvert>T$}.\end{cases} (2.2)

This kernel provides more weight to values of xx near the origin compared to the Fejér kernel (and correspondingly less weight to values farther away), and this is often advantageous.

The result (2.1) then provides a weak version of Ingham’s theorem for the case of weak independence. Ingham established a result similar to (2.1), where linear independence over the rationals for Γ\Gamma was required, the fractions Nγ/(Nγ+1)N_{\gamma}/(N_{\gamma}+1) were naturally omitted, and Γ\Gamma^{\prime} was replaced by Γ[0,T]\Gamma\cap[0,T].

The LLL lattice reduction algorithm [17], combined with some additional linear algebra, may be employed to establish weak independence of a finite set Γ\Gamma^{\prime} of positive real numbers, relative to a parent set Γ\Gamma and a real parameter TT. In this article, we are able to employ some weak independence results established in prior work, so we omit a detailed description of the algorithm, and refer the reader to the following sources. The article [20] provides a detailed explanation of Ingham’s method, extended to the family of functions Lα(x)L_{\alpha}(x) from (1.1), including connections with the Riemann hypothesis, the simplicity of the zeros of the zeta function, and the linear independence question. The publications [4, 19, 21, 22] describe the method of weak independence, and computational strategies for establishing this property. The first of these treats the Mertens function M(x)M(x), the third deals with the family Lα(x)L_{\alpha}(x), and the last one considers H0(x)H_{0}(x) from (1.2). In particular, the paper [21] contains substantial exposition on this method, including for example a proof of (2.1).

3. Oscillations in Sα(x)S_{\alpha}(x)

Since Sα(x)S_{\alpha}(x) from (1.7) is rather similar to Pólya’s function Lα(x)L_{\alpha}(x), one might begin by employing some analysis similar to that of [20] and [21]. Indeed, when α=0\alpha=0 there is a simple relationship connecting these two functions:

S0(2n)\displaystyle S_{0}(2n) =k2n2k(1)Ω(k)k2n2k(1)Ω(k)\displaystyle=\sum_{\begin{subarray}{c}k\leq 2n\\ 2\mid k\end{subarray}}(-1)^{\Omega(k)}-\sum_{\begin{subarray}{c}k\leq 2n\\ 2\nmid k\end{subarray}}(-1)^{\Omega(k)}
=jn(1)Ω(j)k2n(1)Ω(k)+k2n2k(1)Ω(k)\displaystyle=-\sum_{j\leq n}(-1)^{\Omega(j)}-\sum_{k\leq 2n}(-1)^{\Omega(k)}+\sum_{\begin{subarray}{c}k\leq 2n\\ 2\mid k\end{subarray}}(-1)^{\Omega(k)}
=L0(2n)2L0(n).\displaystyle=-L_{0}(2n)-2L_{0}(n).

Thus, we might expect Sα(x)S_{\alpha}(x) to exhibit a bias with sign opposite to that of Lα(x)L_{\alpha}(x), and we might hope that methods that established large oscillations in Lα(x)L_{\alpha}(x) might also produce similarly good results for Sα(x)S_{\alpha}(x). Indeed, this turns out to be the case, as we show below.

Let Y(s)Y(s) denote the Dirichlet series

Y(s)=n=1(1)nΩ(n)ns.Y(s)=\sum_{n=1}^{\infty}\frac{(-1)^{n-\Omega(n)}}{n^{s}}.

If σ>1\sigma>1, then it is straightforward to establish that

Y(s)=(1+21s)ζ(2s)ζ(s).Y(s)=-(1+2^{1-s})\frac{\zeta(2s)}{\zeta(s)}.

This was also given by Sun [24]. Standard results (see, e.g., [20]) show that if either the Riemann hypothesis is false or a zero of ζ(s)\zeta(s) is not simple, then

lim supxSα(x)x12α= and lim infxSα(x)x12α=.\limsup_{x\rightarrow\infty}\frac{S_{\alpha}(x)}{x^{\frac{1}{2}-\alpha}}=\infty\textrm{\;\ and\ \;}\liminf_{x\rightarrow\infty}\frac{S_{\alpha}(x)}{x^{\frac{1}{2}-\alpha}}=-\infty.

Hence we may assume the Riemann hypothesis and the simplicity of the zeros in order to exhibit large oscillations. We follow the same procedure as in [20]. With 𝒮α(x)\mathscr{S}_{\alpha}(x) as in (1.12), we define

Bα(u)=𝒮α(eu)e(α12)u.B_{\alpha}(u)=\mathscr{S}_{\alpha}(e^{u})e^{(\alpha-\frac{1}{2})u}.

The Laplace transform of Bα(u)B_{\alpha}(u) is

Fα(s)=0Bα(u)esu𝑑u,F_{\alpha}(s)=\int_{0}^{\infty}B_{\alpha}(u)e^{-su}\,du,

and as in [20] we compute

Fα(s)={fα(s),if 0α<1/2, or α=1,fα(s)+1+22ζ(1/2)s2,if α=1/2,fα(s)+(1+2α)ζ(2α)ζ(α)(sα+1/2),if 1/2<α<1,F_{\alpha}(s)=\begin{cases}\displaystyle f_{\alpha}(s),&\textrm{if $0\leq\alpha<1/2$, or $\alpha=1$},\\ \displaystyle f_{\alpha}(s)+\frac{1+\sqrt{2}}{2\zeta(1/2)s^{2}},&\textrm{if $\alpha=1/2$},\\[8.0pt] \displaystyle f_{\alpha}(s)+\frac{(1+2^{-\alpha})\zeta(2\alpha)}{\zeta(\alpha)(s-\alpha+1/2)},&\textrm{if $1/2<\alpha<1$},\end{cases} (3.1)

where

fα(s)=Y(s+1/2)sα+1/2=(1+212s)ζ(2s+1)(sα+1/2)ζ(s+1/2).f_{\alpha}(s)=\frac{Y(s+1/2)}{s-\alpha+1/2}=-\frac{(1+2^{\frac{1}{2}-s})\zeta(2s+1)}{(s-\alpha+1/2)\zeta(s+1/2)}. (3.2)

The adjustments made to Sα(x)S_{\alpha}(x) when creating 𝒮α(x)\mathscr{S}_{\alpha}(x) in (1.12) are engineered so that the function Fα(s)F_{\alpha}(s) in (3.1) is analytic in the open half-plane {s=σ+it:σ>0}\{s=\sigma+it\in\mathbb{C}:\,\sigma>0\} with only simple poles on the imaginary axis. In particular, the adjustment at α=1/2\alpha=1/2 removes the pole of order 22 at s=0s=0 in (3.2), and the adjustment for 1/2<α<11/2<\alpha<1 removes the simple pole on the real axis at s=α1/2s=\alpha-1/2. This prepares us to employ the result of Anderson and Stark and the machinery of weak independence.

For s=0s=0, we compute

Res(Fα,0)={1+2(2α1)ζ(1/2),if α[0,1/2)(1/2,1],1+2ζ(1/2)(log22+2+ζ(1/2)2ζ(1/2)γ0),if α=1/2,\operatorname{Res}(F_{\alpha},0)=\begin{cases}\displaystyle-\frac{1+\sqrt{2}}{(2\alpha-1)\zeta(1/2)},&\textrm{if $\alpha\in[0,1/2)\cup(1/2,1]$},\\[8.0pt] \displaystyle\frac{1+\sqrt{2}}{\zeta(1/2)}\left(\frac{\log 2}{2+\sqrt{2}}+\frac{\zeta^{\prime}(1/2)}{2\zeta(1/2)}-\gamma_{0}\right),&\textrm{if $\alpha=1/2$,}\end{cases} (3.3)

where γ0=0.57721\gamma_{0}=0.57721\ldots denotes Euler’s constant. For s=iγns=i\gamma_{n}, where ρn=12+iγn\rho_{n}=\frac{1}{2}+i\gamma_{n} is the nnth zero of the zeta function on the critical line in the upper half plane, we have

Res(Fα,iγn)=(1+2ρ¯n)ζ(2ρn)(ρnα)ζ(ρn).\operatorname{Res}(F_{\alpha},i\gamma_{n})=-\frac{(1+2^{\overline{\rho}_{n}})\zeta(2\rho_{n})}{(\rho_{n}-\alpha)\zeta^{\prime}(\rho_{n})}. (3.4)

If ΓΓ[0,T]\Gamma^{\prime}\subseteq\Gamma\cap[0,T] and Γ\Gamma^{\prime} is NN-independent in Γ[0,T]\Gamma\cap[0,T], then using the result of Anderson and Stark (2.1) (where σ0=1/2\sigma_{0}=1/2) we conclude that

lim infuBα(u)Res(Fα,0)2NN+1γΓkT(γ)|Res(Fα,iγ)|,lim supuBα(u)Res(Fα,0)+2NN+1γΓkT(γ)|Res(Fα,iγ)|.\begin{split}\liminf_{u\to\infty}B_{\alpha}(u)&\leq\operatorname{Res}(F_{\alpha},0)-\frac{2N}{N+1}\sum_{\gamma\in\Gamma^{\prime}}k_{T}(\gamma)\left\lvert\operatorname{Res}(F_{\alpha},i\gamma)\right\rvert,\\ \limsup_{u\to\infty}B_{\alpha}(u)&\geq\operatorname{Res}(F_{\alpha},0)+\frac{2N}{N+1}\sum_{\gamma\in\Gamma^{\prime}}k_{T}(\gamma)\left\lvert\operatorname{Res}(F_{\alpha},i\gamma)\right\rvert.\end{split} (3.5)

In particular, when α=0\alpha=0, this produces (writing ρ=12+iγ\rho=\frac{1}{2}+i\gamma)

S0(eu)eu/2>1+2ζ(1/2)+γΓkT(γ)|(1+2ρ¯)ζ(2ρ)ρζ(ρ)|ϵ\frac{S_{0}(e^{u})}{e^{u/2}}>-\frac{1+\sqrt{2}}{\zeta(1/2)}+\sum_{\gamma\in\Gamma^{\prime}}k_{T}(\gamma)\left\lvert\frac{(1+2^{\overline{\rho}})\zeta(2\rho)}{\rho\zeta^{\prime}(\rho)}\right\rvert-\epsilon (3.6)

for an infinite sequence of uu\to\infty, and likewise

S0(eu)eu/2<1+2ζ(1/2)γΓkT(γ)|(1+2ρ¯)ζ(2ρ)ρζ(ρ)|+ϵ\frac{S_{0}(e^{u})}{e^{u/2}}<-\frac{1+\sqrt{2}}{\zeta(1/2)}-\sum_{\gamma\in\Gamma^{\prime}}k_{T}(\gamma)\left\lvert\frac{(1+2^{\overline{\rho}})\zeta(2\rho)}{\rho\zeta^{\prime}(\rho)}\right\rvert+\epsilon (3.7)

for another infinite sequence of uu\to\infty. Note that (1+2)/ζ(1/2)=1.653-(1+\sqrt{2})/\zeta(1/2)=1.653\ldots , so that, in a loose sense, one expects S0(x)S_{0}(x) to be biased towards positive values. Similarly, S1(eu)eu/2S_{1}(e^{u})e^{u/2} exhibits the same oscillation bounds about (1+2)/ζ(1/2)=1.653(1+\sqrt{2})/\zeta(1/2)=-1.653\ldots , since |ρn1|=|ρn|\left\lvert\rho_{n}-1\right\rvert=\left\lvert\rho_{n}\right\rvert. We note that the conjectures (1.10) and (1.11) are the same as stating that the magnitude of the oscillations here never exceeds approximately 0.6530.653, since 1.6530.653=11.653-0.653=1 and 1.653+0.6532.31.653+0.653\approx 2.3.

We may now complete the proof of Theorem 1.3 by employing a result on weak independence.

Proof of Theorem 1.3.

In [21], we determined a particular set ΓΓ\Gamma^{\prime}\subseteq\Gamma having |Γ|=250\left\lvert\Gamma^{\prime}\right\rvert=250 with the property that Γ\Gamma^{\prime} is 31003100-independent in [0,γ37011010][0,\gamma_{3701}-10^{-10}]. Employing this set in (3.6) and (3.7), and using the kernel of Jurkat and Peyerimhoff (2.2), produces oscillations with magnitude 1.67251931.6725193\ldots in each direction. Since |12+iγ||12+iγα||γ|\left\lvert\frac{1}{2}+i\gamma\right\rvert\geq\left\lvert\frac{1}{2}+i\gamma-\alpha\right\rvert\geq\left\lvert\gamma\right\rvert for 0α10\leq\alpha\leq 1, the first statement follows. The subsequent statements for α=0\alpha=0 and α=1\alpha=1 in (1.14) recapitulate the inequalities in (1.13) for these cases. However, the statements for α=1/4\alpha=1/4 and α=3/4\alpha=3/4 employ the oscillation bounds from (3.5) computed as 1.67266901.6726690 for these cases. Likewise, the final statement (1.15), regarding the case α=1/2\alpha=1/2, employs the computed oscillation bound of 1.672718991.67271899 for this case (which is in fact maximal over 0α10\leq\alpha\leq 1), together with the appropriate entries from (1.12) and (3.3). ∎

We remark that it is possible to improve the bounds in Theorem 1.3 with a new computation, using zeros selected to maximize contributions according to the residues (3.4) in this problem, rather than employing the set of residues that were selected for the functions Lα(x)L_{\alpha}(x). However, we would not witness a substantial gain with a calculation of approximately the same size: we estimate gaining 0.0150.015 in the oscillation bound in each direction from a computation with approximately n=240n=240 zeros. This computation would require several months of core time, so with a high cost relative to a small benefit we opted against a new calculation here.

Figures 3 and 4 illustrate the actual oscillations exhibited by S0(eu)eu/2S_{0}(e^{u})e^{-u/2} and S1(eu)eu/2S_{1}(e^{u})e^{u/2} respectively over 24u34.2524\leq u\leq 34.25\ldots , along with their respective center line at u=±(1+2)/ζ(1/2)u=\pm(1+\sqrt{2})/\zeta(1/2). Also, note that when α=1/2\alpha=1/2 the oscillations of S1/2(eu)S_{1/2}(e^{u}) center on the line

1+22ζ(1/2)u+1+2ζ(1/2)(log22+2+ζ(1/2)2ζ(1/2)γ0)0.826585u1.60167.-\frac{1+\sqrt{2}}{2\zeta(1/2)}u+\frac{1+\sqrt{2}}{\zeta(1/2)}\left(\frac{\log 2}{2+\sqrt{2}}+\frac{\zeta^{\prime}(1/2)}{2\zeta(1/2)}-\gamma_{0}\right)\approx 0.826585u-1.60167. (3.8)

Figure 5 displays the sampled values of S1/2(u)S_{1/2}(u) over 24u3024\leq u\leq 30, along with this line.

4. Oscillations in Hα(x)H_{\alpha}(x)

In order to prove Theorem 1.1, we generalize our analysis in [22], in a manner analogous to the prior section and our study of the behavior Lα(x)L_{\alpha}(x) from [20] and [21]. In [22], for the case α=0\alpha=0 we computed the Laplace transform of H0(eu)/eu/2H_{0}(e^{u})/e^{u/2}: under the Riemann hypothesis, this function is analytic in the half plane σ>0\sigma>0. For the general case, we proceed in a similar manner, except that when α(1/2,1)\alpha\in(1/2,1) one must incorporate an adjustment to prevent the appearance of a pole on the positive real axis in the corresponding Laplace transform. In essence one must account for the value of h(α)h(\alpha) for 1/2<α<11/2<\alpha<1, with h(α)h(\alpha) defined in this interval by (1.5). We made precisely the analogous adjustment in the analysis of Lα(x)L_{\alpha}(x) in [20] and [21]. Using the function α\mathscr{H}_{\alpha} from (1.6), for u0u\geq 0 we set Aα(u)A_{\alpha}(u) to be a suitable scaling of α(eu)\mathscr{H}_{\alpha}(e^{u}):

Aα(u)=α(eu)e(α12)u.A_{\alpha}(u)=\mathscr{H}_{\alpha}(e^{u})e^{(\alpha-\frac{1}{2})u}.

Next, we set

hα(s)=h(s+12)sα+12h_{\alpha}(s)=\frac{h(s+\frac{1}{2})}{s-\alpha+\frac{1}{2}} (4.1)

and

Gα(s)={hα(s),if 0α12,hα(s)h(α)sα+12,if 12<α1.G_{\alpha}(s)=\begin{cases}\displaystyle h_{\alpha}(s),&\textrm{if $0\leq\alpha\leq\frac{1}{2}$},\\ \displaystyle h_{\alpha}(s)-\frac{h(\alpha)}{s-\alpha+\frac{1}{2}},&\textrm{if $\frac{1}{2}<\alpha\leq 1$}.\end{cases}

Using an argument very similar to that employed in [20] for Lα(x)L_{\alpha}(x), we find that for all α[0,1]\alpha\in[0,1], the function Gα(s)G_{\alpha}(s) is the Laplace transform of Aα(s)A_{\alpha}(s):

Gα(s)=0Aα(u)esu𝑑u,G_{\alpha}(s)=\int_{0}^{\infty}A_{\alpha}(u)e^{-su}\,du, (4.2)

and, under the Riemann hypothesis, the integral in (4.2) converges for all σ>0\sigma>0. One slight difference arises here: when α=1/2\alpha=1/2 there is a pole of hα(s)h_{\alpha}(s) in (4.1) when s=0s=0. However, this is canceled by the zero of h(1/2)h(1/2), which itself comes from the pole of ζ(2s)\zeta(2s) in (1.5). As such, unlike the case of L1/2(x)L_{1/2}(x) or S1/2(x)S_{1/2}(x), there is no dramatic bias in H1/2(x)H_{1/2}(x).

It is now straightforward to calculate the residue of Gα(s)G_{\alpha}(s) at each pole along σ=0\sigma=0. We have

Res(Gα,0)={0,if 0α12,h(α),if 12<α1.\operatorname{Res}(G_{\alpha},0)=\begin{cases}0,&\textrm{if $0\leq\alpha\leq\frac{1}{2}$},\\ h(\alpha),&\textrm{if $\frac{1}{2}<\alpha\leq 1$}.\end{cases} (4.3)

From (4.3) and the fact that h(1)=0h(1)=0, we expect no bias in the sum Hα(x)H_{\alpha}(x) for 0α1/20\leq\alpha\leq 1/2 and for α=1\alpha=1. Over 1/2<α<11/2<\alpha<1, we expect a bias in this function whenever h(α)0h(\alpha)\neq 0. Figure 1 exhibits h(α)h(\alpha) over 1/2α11/2\leq\alpha\leq 1. It is interesting that the sign of the bias changes over this range. For 1/2<α<α0.630931/2<\alpha<\alpha^{*}\approx 0.63093, our plot indicates that we expect Hα(x)H_{\alpha}(x) to exhibit a negative bias, with maximal negative bias occurring near α1=0.55336\alpha_{1}=0.55336, where h(α1)=0.0950579h(\alpha_{1})=-0.0950579\ldots . That is, the values of Hα1(x)H_{\alpha_{1}}(x) will oscillate relative to the base curve h(α1)e(α112)uh(\alpha_{1})e^{(\alpha_{1}-\frac{1}{2})u}. For α<α<1\alpha^{*}<\alpha<1, we expect the sum Hα(x)H_{\alpha}(x) to display a positive bias, with maximal bias occurring near α2=0.73587\alpha_{2}=0.73587, where h(α2)=0.0804324h(\alpha_{2})=0.0804324\ldots . Figure 7 displays Hα(eu)eα1/2H_{\alpha}(e^{u})e^{\alpha-1/2} for two values of α\alpha near these points of maximal bias. In these plots, the bias specified by h(α)h(\alpha) was not removed as in (1.6), so in each of these graphs the oscillations center on an exponential function. In part (b) of this figure, where α=3/4\alpha=3/4, the bias is quite evident, since the centering curve is eu/4e^{u/4}. However, in part (a) it is not so obvious, since the guiding exponential eu/20e^{u/20} remains rather small over the plotted interval.

Refer to caption
Figure 1. h(α)h(\alpha) for 12α1\frac{1}{2}\leq\alpha\leq 1.

We may now establish Theorem 1.1 by computing the relevant residues and employing a particular set of zeros of the zeta function known to possess a weak independence property.

Proof of Theorem 1.1.

In [22], we computed the residue of G0(s)G_{0}(s) at each of its simple poles on the imaginary axis, so at each point s=iγns=i\gamma_{n} where ρn=12+γn\rho_{n}=\frac{1}{2}+\gamma_{n} denotes the nnth zero of the Riemann zeta function on the critical line in the upper half plane. This derivation generalizes in a natural way and yields

Res(Gα,γn)=F6(ρn)(ρnα)ζ(ρn)Z6(ρn).\operatorname{Res}(G_{\alpha},\gamma_{n})=\frac{F_{6}(\rho_{n})}{(\rho_{n}-\alpha)\zeta^{\prime}(\rho_{n})Z_{6}(\rho_{n})}.

The same article employed a particular set Γ[0,T]\Gamma^{\prime}\subseteq[0,T] of ordinates of 239239 zeros of the zeta function on the critical line, with T=γ37011010T=\gamma_{3701}-10^{-10}, to establish large oscillations for 0\mathscr{H}_{0}. By proving that Γ\Gamma^{\prime} is NN-independent in Γ[0,T]\Gamma\cap[0,T] with N=3950N=3950, we obtained Theorem 1.1 from (2.1) in the case α=0\alpha=0, since

2NN+1γΓkT(γ)|Res(G0,γ)|>1.700144.\frac{2N}{N+1}\sum_{\gamma\in\Gamma^{\prime}}k_{T}(\gamma)\left\lvert\operatorname{Res}(G_{0},\gamma)\right\rvert>1.700144. (4.4)

Theorem 1.1 follows almost immediately. Since |12+iγ||12+iγα||γ|\left\lvert\frac{1}{2}+i\gamma\right\rvert\geq\left\lvert\frac{1}{2}+i\gamma-\alpha\right\rvert\geq\left\lvert\gamma\right\rvert for 0α10\leq\alpha\leq 1, certainly

|Res(G0,γ)||Res(Gα,γ)||Res(G1/2,γ)|\left\lvert\operatorname{Res}(G_{0},\gamma)\right\rvert\leq\left\lvert\operatorname{Res}(G_{\alpha},\gamma)\right\rvert\leq\left\lvert\operatorname{Res}(G_{1/2},\gamma)\right\rvert

over this range, and thus the bound (4.4) holds as well when G0G_{0} is replaced by GαG_{\alpha}, for any α[0,1]\alpha\in[0,1]. ∎

We remark that since ρn(1α)=αρn¯\rho_{n}-(1-\alpha)=\overline{\alpha-\rho_{n}}, we see that |ρnα|=|ρn(1α)|\left\lvert\rho_{n}-\alpha\right\rvert=\left\lvert\rho_{n}-(1-\alpha)\right\rvert, so the bound for G1αG_{1-\alpha} is in fact exactly the same as that for GαG_{\alpha} for α[0,1]\alpha\in[0,1]. In particular, the bound for α=1\alpha=1, which was of particular interest in [24], matches the one for α=0\alpha=0. We add also that our method establishes bounds on oscillations for 0<α<10<\alpha<1 that are only slightly stronger than (4.4). In the most beneficial case (when α=1/2\alpha=1/2), we obtain

2NN+1γΓkT(γ)|Res(G1/2,γ)|>1.700282.\frac{2N}{N+1}\sum_{\gamma\in\Gamma^{\prime}}k_{T}(\gamma)\left\lvert\operatorname{Res}(G_{1/2},\gamma)\right\rvert>1.700282.

Figure 6 displays plots of Aα(u)=α(u)e(α12)uA_{\alpha}(u)=\mathscr{H}_{\alpha}(u)e^{(\alpha-\frac{1}{2})u} for a number of values of α\alpha. These plots were obtained from sampling the values of these functions Hα(x)H_{\alpha}(x) for xe30x\leq e^{30}. The graphs also display the axes where the oscillations are centered. In part (d) of this figure, where α=3/4\alpha=3/4, the axis is the horizontal line at h(3/4)=0.0793843h(3/4)=0.0793843\ldots ; for the others it is the horizontal axis.

5. Computations

We completed a number of computations to sample the values of Sα(x)S_{\alpha}(x) and Hα(x)H_{\alpha}(x) for several choices of the parameter α\alpha, as well as W(x)W(x) from (1.16). Our method is similar to the one developed in [6] for the investigation of L0(x)L_{0}(x) and L1(x)L_{1}(x); a similar method was employed in [21] for Lα(x)L_{\alpha}(x) and in [22] for H0(x)H_{0}(x). We summarize the method used here for obtaining values of the functions Sα(x)S_{\alpha}(x), in order to provide information for Theorem 1.2.

By using Perron’s formula and the procedure of [20], we find that

S0(eu)eu/2=1+2ζ(1/2)|γn|T(1+21/2iγn)ζ(2ρn)eiγnuρnζ(ρn)+E(u,T),\frac{S_{0}(e^{u})}{e^{u/2}}=-\frac{1+\sqrt{2}}{\zeta(1/2)}-\sum_{\left\lvert\gamma_{n}\right\rvert\leq T}\frac{(1+2^{1/2-i\gamma_{n}})\zeta(2\rho_{n})e^{i\gamma_{n}u}}{\rho_{n}\zeta^{\prime}(\rho_{n})}+E(u,T), (5.1)

where the error term E(u,T)E(u,T) satisfies E(u,T)0E(u,T)\to 0 as uu\to\infty. We use this to estimate the behavior of S0(eu)S_{0}(e^{u}), by setting E(u,T)=0E(u,T)=0 in (5.1) and calculating the expression on the right with TT set to certain values, and then plotting the results. When T=3000T=3000, so with 24692469 zeros of the zeta function in the upper half plane, we detected a potential crossing point for the lower bound in (1.10)—see Figure 2(a). This suggests that S0(x)/xS_{0}(x)/\sqrt{x} may dip below 11 near x=exp(34.186)7.0271014x=\exp(34.186)\approx 7.027\cdot 10^{14}, and similarly S1(x)xS_{1}(x)\sqrt{x} may cross the lower threshold of 2.3-2.3 from (1.11) near the same location. These values seemed within range of a distributed computation, so we aimed to calculate S0(x)S_{0}(x) and S1(x)S_{1}(x) for x7.51014x\leq 7.5\cdot 10^{14}.

Refer to caption Refer to caption
(a) [34.18,34.19][34.18,34.19] (T=3000T=3000) (b) [64.214,64.215][64.214,64.215] (T=5200T=5200)
Figure 2. Estimating S0(eu)/eu/2S_{0}(e^{u})/e^{u/2} over particular intervals using (5.1).
Refer to caption
Figure 3. Sampled values for S0(eu)/eu/2S_{0}(e^{u})/e^{u/2}, oscillating about (1+2)/ζ(1/2)-(1+\sqrt{2})/\zeta(1/2).
Refer to caption
Figure 4. Sampled values for S1(eu)eu/2S_{1}(e^{u})e^{u/2}, oscillating about (1+2)/ζ(1/2)(1+\sqrt{2})/\zeta(1/2).

To calculate values for S0(x)S_{0}(x), we first created a large table to store the parity of the values of nΩ(n)n-\Omega(n) for all positive integers nn with gcd(n,30)=1\gcd(n,30)=1 and nMS=51010n\leq M_{S}=5\cdot 10^{10}. This required about 1.551.55 gigabytes of storage. We employed a boot-strapping strategy to create this table: once the values up to a bound yy have been computed, we can then sieve the interval [y+1,2y][y+1,2y] using the primes p2yp\leq\sqrt{2y} to determine the parity of the total number of divisors for each qualifying integer in this interval. Here we use the existing table for [1,y][1,y] whenever a remaining cofactor lands in this interval, once powers of 22, 33, and 55 are properly accounted for. After the full table to MSM_{S} has been constructed, we launch a distributed calculation, with each processor employing a copy of the table to assist with sieving its own portion of the targeted range. Each process handled an interval of size 810108\cdot 10^{10}, usually breaking this up into 32003200 subintervals of size 2525 million in order to make efficient use of memory, as it was advantageous in scheduling to control the total memory size of each job. Two bits per integer were required during the sieving process, to record the parity of nΩ(n)n-\Omega(n) at location nn, or to indicate that the value at nn is not yet known, so a subinterval required 6.256.25 megabytes of memory.

When a process sieves an interval [a,b][a,b], it first sieves using primes b/MS<pbb/M_{S}<p\leq\sqrt{b}, working from the largest primes downward, since removing such a prime from any integer in this interval produces a cofactor in the stored table for [1,MS][1,M_{S}], after removing any factors of 22, 33, and 55. After this we sieve with the primes 7pb/MS7\leq p\leq b/M_{S}, starting again with the largest primes and working downwards. The cofactor remaining after removing all factors of such a prime pp may still exceed MSM_{S}, so we employ trial division beginning with p=2p=2 until the remaining cofactor is less than MSM_{S}, or has been determined to be prime. After this, the remaining unknown elements in the current interval [a,b][a,b] must have the form 2i3j5kq2^{i}3^{j}5^{k}q with q=1q=1 or qq prime, and some final scans take care of these. Cumulative totals are computed at the conclusion of each subinterval, and sampled values are occasionally produced as output. These sampled values record cumulative totals relative to the start of the large interval handled by the current process. At its conclusion, a process records cumulative totals over its entire run, and once all processes are completed these partial sums may be used to adjust the sampled values produced across the entire computation.

The same strategy was employed to compute values of Sα(x)S_{\alpha}(x) for α=1/4\alpha=1/4, 1/21/2, 3/43/4, and 11, although here we accumulated the positive and negative contributions separately to guard against loss of precision.

Our computations allowed us to establish Theorem 1.2. Record high and low values were recorded for each interval of size 810108\cdot 10^{10} handled by a process, and this produced the record values in parts (b) and (d) of this theorem. For each of parts (a) and (c), we needed to run an additional job to determine the precise first crossing points, once the true value of each process’ starting point was known.

Figures 3 and 4 exhibit our results for sampling over 24ulog(7.51014)34.25124\leq u\leq\log(7.5\cdot 10^{14})\approx 34.251 for the functions S0(eu)eu/2S_{0}(e^{u})e^{-u/2} and S1(eu)eu/2S_{1}(e^{u})e^{u/2}. These plots also show the center of the oscillations ±(1+2)/ζ(1/2)\pm(1+\sqrt{2})/\zeta(1/2), and the conjectured bounds from (1.10) and (1.11). In each plot, the crossing in the conjectured lower bounds in these inequalities near u=34.186u=34.186 is evident.

Refer to caption
Figure 5. S1/2(eu)S_{1/2}(e^{u}) and the line (3.8) for 24u3024\leq u\leq 30.

No violations of the upper bound in (1.10) or (1.11) were found in this computation; the closest point was

S0(1165833625987)=2474979,S_{0}(1165833625987)=2474979,

which achieves 2.29222.2922, and is visible as a near-miss in Figure 3. A similar near-miss occurs for S1(x)S_{1}(x) as seen in Figure 4. However, further experimentation with (5.1) suggested a potential location for such crossings. Figure 2(b) illustrates a crossing for the estimate from this expression when T=5200T=5200, so using 47344734 zeros of the zeta function, near u=64.21455u=64.21455, or approximately x=7.271027x=7.27\cdot 10^{27}. This is well beyond our present computational range.

Our strategy was similar for computing Hα(x)H_{\alpha}(x), for a number of values of α\alpha, with suitable adjustments to the code to track the parity of ω(n)\omega(n) rather than nΩ(n)n-\Omega(n). Figure 6 exhibits plots for Aα(u)=α(u)e(α12)uA_{\alpha}(u)=\mathscr{H}_{\alpha}(u)e^{(\alpha-\frac{1}{2})u} for several values of α\alpha.

Refer to caption Refer to caption Refer to caption
(a) α=0\alpha=0 (b) α=1/4\alpha=1/4 (c) α=1/2\alpha=1/2
Refer to caption Refer to caption
(d) α=3/4\alpha=3/4 (e) α=1\alpha=1
Figure 6. Aα(u)=α(u)e(α12)uA_{\alpha}(u)=\mathscr{H}_{\alpha}(u)e^{(\alpha-\frac{1}{2})u} for a number of values of α[0,1]\alpha\in[0,1].
Refer to caption Refer to caption
(a) α=0.55\alpha=0.55, h(α)=0.094719h(\alpha)=-0.094719\ldots (b) α=0.75\alpha=0.75, h(α)=0.079384h(\alpha)=0.079384\ldots
Figure 7. Hα(eu)e(α12)uH_{\alpha}(e^{u})e^{(\alpha-\frac{1}{2})u}, without accounting for the bias h(α)h(\alpha) as in (1.6), near locations of maximal bias in the negative and positive directions respectively.

A similar strategy was employed to compute values of W(x)W(x) up to 2.510142.5\cdot 10^{14}, although here the table size was MW=31010M_{W}=3\cdot 10^{10}, since we now required four bits to store the value of Ω(n)\Omega(n) at each location in this interval, rather than simply its parity (note log7(31010)12.4\log_{7}(3\cdot 10^{10})\approx 12.4). This table then required about 3.723.72 gigabytes of memory. During the sieving stage, each process allocated one byte per integer in each sieving block, since log2(2.51014)47.8\log_{2}(2.5\cdot 10^{14})\approx 47.8, so a subinterval required 2525 megabytes of storage. We find that Sun’s conjecture (1.17) survives over this range: the maximum value of W(x)/xW(x)/x for integers x[3079,2.51014]x\in[3079,2.5\cdot 10^{14}] occurs at x=6261x=6261, where the ratio is 0.9894580.989458\ldots ; the minimum value occurs at x=3130x=3130, where it is 0.994568-0.994568\ldots . We report a few additional values in Table 1, including the best value achieved in each direction for 1.51010x2.510141.5\cdot 10^{10}\leq x\leq 2.5\cdot 10^{14}. Figure 8 displays W(eu)euW(e^{u})e^{-u} over 24ulog(2.51014)33.15224\leq u\leq\log(2.5\cdot 10^{14})\approx 33.152.

Table 1. Some local extrema for W(x)/xW(x)/x.
xx W(x)W(x) W(x)/xW(x)/x
31303130 3113-3113 0.994568-0.994568\ldots
62616261 61956195 0.9894580.989458\ldots
64103136410313 63169056316905 0.9854280.985428\ldots
1282062612820626 12574965-12574965 0.980838-0.980838\ldots
5251328573552513285735 51364764131-51364764131 0.978128-0.978128\ldots
105026571390105026571390 102737766207102737766207 0.9782070.978207\ldots
Refer to caption
Figure 8. Sampled values for W(eu)euW(e^{u})e^{-u}.

We note that the function W(x)W(x) may be amenable to some further analysis. As in (1.4), the corresponding Dirichlet function in this case is

J(s)=n=1(2)Ω(n)ns=p(1+2ps)1J(s)=\sum_{n=1}^{\infty}\frac{(-2)^{\Omega(n)}}{n^{s}}=\prod_{p}\left(1+\frac{2}{p^{s}}\right)^{-1}

for σ>1\sigma>1, and using methods similar to that employed to create (1.5) for h(s)h(s), one may show that

J(s)=ζ(2s)3ζ(4s)3J4(s)ζ(s)2ζ(3s)2,J(s)=\frac{\zeta(2s)^{3}\zeta(4s)^{3}J_{4}(s)}{\zeta(s)^{2}\zeta(3s)^{2}},

where

J4(s)=p(1p2s)3(1p4s)3(1+2ps)(1ps)2(1p3s)2,J_{4}(s)=\prod_{p}\frac{(1-p^{-2s})^{3}(1-p^{-4s})^{3}}{(1+2p^{-s})(1-p^{-s})^{2}(1-p^{-3s})^{2}},

which converges for σ>1/5\sigma>1/5. The function J(s+1/2)/(s+1/2)J(s+1/2)/(s+1/2) has poles of order 22 on the imaginary axis, as well as one of order 33 at the origin. We can manipulate this to ensure that the result of Anderson and Stark (2.1) is applicable. However, some additional complications arise, which we hope to address in future work.

6. Other conjectures

Sun made two additional families of conjectures concerning the quantity nΩ(n)n-\Omega(n). First, in [24, Conj. 1.2], Sun opined that for m=3m=3, 5m185\leq m\leq 18, or m=20m=20, the proportion of integers nxn\leq x having the property that m(nΩ(n))m\mid(n-\Omega(n)) exceeds 1/m1/m, provided that xs(m)x\geq s(m), for a particular quantity s(m)s(m). For example, it was conjectured that s(3)=62s(3)=62, s(5)=187s(5)=187, and s(20)=61s(20)=61 all suffice. For m=4m=4, this proportion was posited to be bounded above by 1/41/4, for x1793193x\geq 1793193. No conjecture was made in the case m=19m=19, although it was remarked that perhaps this proportion is infinitely often less than 1/191/19, and infinitely often greater. We verified that Sun’s seventeen conjectures here hold for x1011x\leq 10^{11}. We can also report that the last crossing in the case m=19m=19 over this range occurs at x=49675549593x=49675549593: from here to x=1011x=10^{11} the proportion of integers nxn\leq x having 19(nΩ(n))19\mid(n-\Omega(n)) exceeds 1/191/19.

Second, in [24, Conj. 1.3] Sun stated a conjecture regarding a variant of S0(x)S_{0}(x) twisted by Dirichlet characters. For d0d\equiv 0 or 11 mod 44, let (dn)(\frac{d}{n}) denote the Kronecker symbol, and let

Sd(x)=nx(1)nΩ(n)(dn).S_{d}(x)=\sum_{n\leq x}(-1)^{n-\Omega(n)}\left(\frac{d}{n}\right).

Sun posited for example that

S4(x)<0,S7(x)<0,S3(x)>0,S5(x)>0,S_{-4}(x)<0,\quad S_{-7}(x)<0,\quad S_{-3}(x)>0,\quad S_{5}(x)>0,

with x11x\geq 11 sufficing in each case. In fact, additional conjectures of this form for other values of dd were stated as well. These could all be investigated by using results on NN-independence of zeros of the Dirichlet LL-function L(s,χ)L(s,\chi) where χ\chi is the non-principal character modulo 44. We know of no calculation, similar to that for ζ(s)\zeta(s) in [3, 4], that establishes good NN-independence for Dirichlet LL-functions, although Grosswald [10, Thm. 5 and §8, §9] presents some calculations to this end. Such a program of research appears both possible and interesting: we hope to return to this in future work.

Acknowledgments

We thank Peter Humphries for bringing these questions to our attention, and we thank the referee for a number of helpful comments. We also thank NCI Australia and UNSW Canberra for computational resources. This research was undertaken with the assistance of resources and services from the National Computational Infrastructure (NCI), which is supported by the Australian Government.

References

  • [1] R. J. Anderson and H. M. Stark. Oscillation theorems. Lecture Notes in Math., 899:79–106, 1981. MR0654520 (83h:10082)
  • [2] P. T. Bateman. Proof of a conjecture of Grosswald. Duke Math. J., 25:67–72, 1958. MR0091970 (19,1040a)
  • [3] P. T. Bateman, J. W. Brown, R. S. Hall, K. E. Kloss, and R. M. Stemmler. Linear relations connecting the imaginary parts of the zeros of the zeta function. Computers in Number Theory (Proc. Sci. Res. Council Atlas Sympos. No. 2, Oxford, 1969), 1971, pp. 11–19. MR0330069 (48 #8408)
  • [4] D. G. Best and T. S. Trudgian. Linear relations of zeroes of the zeta-function. Math. Comp., 84(294): 2047–2058, 2015. MR3335903
  • [5] O. Bordellès. Review of [24], MathSciNet.
  • [6] P. Borwein, R. Ferguson, and M. J. Mossinghoff. Sign changes in sums of the Liouville function. Math. Comp., 77(263):1681–1694, 2008. MR2398787 (2009b:11227)
  • [7] H. G. Diamond. Two oscillation theorems. In The theory of arithmetic functions (Proc. Conf., Western Michigan Univ., Kalamazoo, Mich., 1971), 1972, Springer, Berlin, pp. 113–118. MR0332684 (48 #11010)
  • [8] E. Grosswald. The average order of an arithmetic function. Duke Math. J., 23:41–44, 1956. MR0074459 (17,588f)
  • [9] E. Grosswald. Oscillation theorems of arithmetical functions. Trans. Amer. Math. Soc., 126:1–28, 1967. MR0202685 (34 #2545)
  • [10] E. Grosswald. Oscillation theorems. Lecture Notes in Math., 251:141–168, 1972. MR0332685 (48 #11011)
  • [11] C. B. Haselgrove. A disproof of a conjecture of Pólya. Mathematika, 5:141–145, 1958. MR0104638 (21 #3391)
  • [12] P. Humphries. The distribution of weighted sums of the Liouville function and Pólya’s conjecture. J. Number Theory, 133(2):545–582, 2013. MR2994374
  • [13] G. Hurst. Computations of the Mertens function and improved bounds on the Mertens conjecture. Math. Comp., 87(310):1013–1028, 2018. MR3739227
  • [14] A. E. Ingham. On two conjectures in the theory of numbers. Amer. J. Math., 64(1):313–319, 1942. MR0006202 (3,271c)
  • [15] W. Jurkat and A. Peyerimhoff. A constructive approach to Kronecker approximations and its application to the Mertens conjecture. J. Reine Angew. Math., 286/287:322–340, 1976. MR0429789 (55 #2799)
  • [16] R. S. Lehman. On Liouville’s function. Math. Comp., 14:311–320, 1960. MR0120198 (22 #10955)
  • [17] A. K. Lenstra, H. W. Lenstra, Jr., and L. Lovász. Factoring polynomials with rational coefficients. Math. Ann., 261(4):515–534, 1982. MR0682664 (84a:12002)
  • [18] J. van de Lune and R. E. Dressler. Some theorems concerning the number theoretic function ω(n)\omega(n). J. Reine Angew. Math, 277:117–119, 1975. MR0384726 (52 #5599)
  • [19] M. J. Mossinghoff, T. Oliveira e Silva and T. S. Trudgian. The distribution of kk-free numbers. Math. Comp., to appear. Preprint available at arXiv:1912.04972, 2020.
  • [20] M. J. Mossinghoff and T. S. Trudgian. Between the problems of Pólya and Turán. J. Aust. Math. Soc., 93(1-2):157–171, 2012. MR3062002
  • [21] M. J. Mossinghoff and T. S. Trudgian. The Liouville function and the Riemann hypothesis. In Exploring the Riemann Zeta Function, H. L. Montgomery et al. (eds.), 2017, Springer, Cham, pp. 201–221. MR3700043
  • [22] M. J. Mossinghoff and T. S. Trudgian. A tale of two omegas. In 75 Years of Mathematics of Computation, S. C. Brenner, I. Shparlinski, C.-W. Shu, and D. B. Szyld, eds., Contemp. Math. 754, Amer. Math. Soc., Providence, RI, 2020, pp. 343–364. MR4132130
  • [23] G. Pólya. Verschiedene Bemerkungen zur Zahlentheorie. Jahresber. Deutsch. Math.-Verein., 28:31–40, 1919.
  • [24] Z.-W. Sun. On a pair of zeta functions. Int. J. Number Theory, 12(8): 2323–2342, 2016. MR3562029
  • [25] P. Turán. On some approximative Dirichlet-polynomials in the theory of the zeta-function of Riemann. Danske Vid. Selsk. Mat.-Fys. Medd., 24(17): 1–36, 1948. MR0027305 (10,286a)