1 Introduction
1.1 Background
The Lindelöf hypothesis (LH) asserts that for every
$\varepsilon>0$
,
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230128160005443-0196:S0004972722000259:S0004972722000259_eqnu2.png?pub-status=live)
In [Reference Littlewood9], Littlewood showed that a stronger form of LH follows from the Riemann hypothesis (RH): namely, for some positive constant
$C_1>0$
and for all large
$\lvert t\rvert $
,
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230128160005443-0196:S0004972722000259:S0004972722000259_eqnu3.png?pub-status=live)
where the sharpest size of the implicit constant
$C_1$
has been given by Chandee and Soundararajan [Reference Chandee and Soundararajan4].
In the opposite direction, Titchmarsh (see [Reference Titchmarsh12, Theorem 8.12]) proved that for any
$\alpha <1/2$
and large enough T,
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230128160005443-0196:S0004972722000259:S0004972722000259_eqnu4.png?pub-status=live)
Using the resonance method, Soundararajan [Reference Soundararajan10] proved that there exists
$t\in [T,2T]$
such that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230128160005443-0196:S0004972722000259:S0004972722000259_eqnu5.png?pub-status=live)
Recently, Bondarenko and Seip [Reference Bondarenko and Seip2] made a breakthrough by showing that for any constant
$C_2<1/\sqrt {2}$
,
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230128160005443-0196:S0004972722000259:S0004972722000259_eqnu6.png?pub-status=live)
Later, Bondarenko and Seip [Reference Bondarenko and Seip3] improved their result by widening the allowable range of
$C_2$
, showing that the above bound holds for any
$C_2<1$
. Currently, the sharpest lower bound is due to De la Bretèche and Tenenbaum [Reference De la Bretèche and Tenenbaum5] who established
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230128160005443-0196:S0004972722000259:S0004972722000259_eqnu7.png?pub-status=live)
In this paper, we investigate the extreme values of the Rankin–Selberg L-functions associated with holomorphic cusp forms in the vertical direction. We begin with some definitions for these L-functions.
1.2 Rankin–Selberg L-functions
Let f be a primitive holomorphic cusp form of weight
$k\geq 1$
for
${\textrm {SL}}_2(\mathbb {Z})$
. Let
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230128160005443-0196:S0004972722000259:S0004972722000259_eqnu8.png?pub-status=live)
be its normalised Fourier expansion at the cusp
$\infty $
, where
$\lambda _f(n)\in \mathbb {R}\, (n=1, 2, \ldots )$
are eigenvalues of Hecke operators
$T(n)$
(that is,
$T(n)f=\lambda _f(n)f$
), normalised so that
$\lambda _f(1)=1$
. By the work of Deligne, there exist
$\alpha _f(p),\beta _f(p)\in \mathbb {C}$
, satisfying
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230128160005443-0196:S0004972722000259:S0004972722000259_eqnu9.png?pub-status=live)
and
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230128160005443-0196:S0004972722000259:S0004972722000259_eqnu10.png?pub-status=live)
The Ramanujan conjecture states that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230128160005443-0196:S0004972722000259:S0004972722000259_eqn1.png?pub-status=live)
for all prime numbers p. For holomorphic f, this was proved by Deligne [Reference Deligne6] in 1974. Thus for each prime number p, there is a unique
$\xi _f(p)\in [0,\pi ]$
such that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230128160005443-0196:S0004972722000259:S0004972722000259_eqnu11.png?pub-status=live)
According to the Sato–Tate conjecture, the sequence
$\{\xi _f(p)\}_p$
is equi-distributed on
$[0,\pi ]$
with respect to the measure
$({2}/{\pi })\sin ^2\xi \,d\xi $
, that is, for a given subinterval
${[a,b]\subset [0,\pi ]}$
,
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230128160005443-0196:S0004972722000259:S0004972722000259_eqn2.png?pub-status=live)
This has been proved by Barnet-Lamb et al. [Reference Barnet-Lamb, Geraghty, Harris and Taylor1]. (For Maass cusp forms, both (1.1) and (1.2) are still open.)
For
$\operatorname {Re} s>1$
, the Rankin–Selberg L-function attached to f is
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230128160005443-0196:S0004972722000259:S0004972722000259_eqnu12.png?pub-status=live)
It can be continued analytically to the whole complex plane with a simple pole at
$s=1$
and satisfies the functional equation
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230128160005443-0196:S0004972722000259:S0004972722000259_eqnu13.png?pub-status=live)
for the complete L-function
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230128160005443-0196:S0004972722000259:S0004972722000259_eqnu14.png?pub-status=live)
and the gamma factor
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230128160005443-0196:S0004972722000259:S0004972722000259_eqnu15.png?pub-status=live)
Following the argument of Bondarenko and Seip [Reference Bondarenko and Seip3], we establish the following theorem.
Theorem 1.1. Assume the GRH. Let
$0\leq \delta <1$
be given. If T is sufficiently large, then there exists t with
$T^{\delta }\leq t\leq T$
such that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230128160005443-0196:S0004972722000259:S0004972722000259_eqn3.png?pub-status=live)
where C is a positive number depending on f, satisfying
$C < \mathscr {X}\sqrt {1-\delta }$
, and where
${\mathscr {X}:=({2}/{\pi })\int _{0}^{\pi /3}\sin ^2\xi \,d\xi} $
.
The assumption of the GRH is only needed in the proof of Theorem 1.1 to handle the moments
$\int _{1}^{T}\lvert L(\frac 12+it,f\times f)\rvert ^{2r}\,dt$
(see Lemma 2.2). In fact, the convexity bound is sufficient for the proof of Lemma 2.1 and subconvexity bounds will not lead to any improvement of the result.
The positivity of the coefficients of the Rankin–Selberg L-functions is necessary for the method in the proof. Hence, a principal difference between our version of the resonance method and that used earlier by Bondarenko and Seip [Reference Bondarenko and Seip3] is that we have to consider a suitable subcollection of the set of prime numbers in our resonator (see Section 2.3 for the details).
2 Preparation for the proof
2.1 Convolution formula for
$L(s,f\times f)$
We define the Fourier transform
$\widehat {F}$
of F on
$\mathbb {R}$
as
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230128160005443-0196:S0004972722000259:S0004972722000259_eqnu16.png?pub-status=live)
Lemma 2.1. Suppose that
$\tfrac 12 \leq \sigma <1$
and let
$F(x+iy)$
be an analytic function in the horizontal strip
$\sigma -2\leq y\leq 0$
satisfying the growth estimate
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230128160005443-0196:S0004972722000259:S0004972722000259_eqnu17.png?pub-status=live)
when
$\lvert x\rvert \rightarrow \infty $
. Then for every real t,
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230128160005443-0196:S0004972722000259:S0004972722000259_eqnu18.png?pub-status=live)
where
$L(s,f\times f):=\sum _{m=1}^{\infty }A(m)m^{-s}$
and
$\rho _f$
is the residue of
$L(s,f\times f)$
at
$s=1$
.
Proof. Let T be a large positive number and let
$\mathscr {R}(T)$
denote the contour consisting of the line segments connecting
$\sigma -iT, 2-iT, 2+iT, \sigma +iT$
.
By the residue theorem applied to
$G(z):=L(z+it,f\times f)F(i\sigma -iz)$
in
$\mathscr {R}(T)$
,
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230128160005443-0196:S0004972722000259:S0004972722000259_eqnu19.png?pub-status=live)
Since
$L(s,f\times f)$
is holomorphic in the s-plane except for a simple pole at
$s=1$
,
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230128160005443-0196:S0004972722000259:S0004972722000259_eqn4.png?pub-status=live)
Applying the upper bound for
$F(x+iy)$
in Lemma 2.1, (2.1) and the convexity bound [Reference Iwaniec and Kowalski8, (5.21)], we arrive at
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230128160005443-0196:S0004972722000259:S0004972722000259_eqnu20.png?pub-status=live)
Also,
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230128160005443-0196:S0004972722000259:S0004972722000259_eqnu21.png?pub-status=live)
Combining these two formulae completes the proof of Lemma 2.1.
2.2 Moments of L-functions
Define
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230128160005443-0196:S0004972722000259:S0004972722000259_eqn5.png?pub-status=live)
Lemma 2.2 [Reference Tang and Xiao11, Theorem 1.1].
Assume the GRH. Let f be a primitive holomorphic cusp form of weight
$k\geq 1$
for
${\textrm {SL}}_2(\mathbb {Z})$
. Let
$I_r(T,f\times f)$
be defined as in (2.2). Then for all real numbers
$r>0$
and sufficiently large T,
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230128160005443-0196:S0004972722000259:S0004972722000259_eqnu22.png?pub-status=live)
2.3 Construction of the resonator
The resonance method can be traced back to a paper of Voronin [Reference Voronin13]. It was developed independently and significantly refined by Hilberdink [Reference Hilberdink7] and by Soundararajan [Reference Soundararajan10].
A resonator (in the spirit of [Reference Bondarenko and Seip3, Section 3]) is a function of the form
$R(t)$
, where
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230128160005443-0196:S0004972722000259:S0004972722000259_eqn6.png?pub-status=live)
and
$\mathscr {M}'$
is a suitable finite set of positive integers whose construction is given below.
Let
$0<\delta <1$
be a fixed real number, and let
$\kappa $
and
$\gamma $
with
$0<\kappa <1$
and
$0<\gamma <1$
be parameters still to be chosen. Define
$N=[T^{\kappa }]$
, where
$[x]$
denotes the integer part of x. Let P be the set of prime numbers p such that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230128160005443-0196:S0004972722000259:S0004972722000259_eqn7.png?pub-status=live)
We define
$h(n)$
to be the multiplicative function supported on the set of square-free numbers such that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230128160005443-0196:S0004972722000259:S0004972722000259_eqnu23.png?pub-status=live)
and
$h(p)=0$
otherwise. Fix
$\Delta $
with
$1<\Delta <1/\gamma $
. For each
$\ell \in \{1,\ldots ,[(\log _2N)^{\gamma }]\}$
, we define the sets
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230128160005443-0196:S0004972722000259:S0004972722000259_eqnu24.png?pub-status=live)
Next, we define the set
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230128160005443-0196:S0004972722000259:S0004972722000259_eqnu25.png?pub-status=live)
Then
$\mathscr {M}$
is the set of square-free numbers n that have at most
$\Delta\log N/(\ell^2 \log_3N) $
divisors in
$P_{\ell }$
.
Now, let
$\mathscr {J}$
be the set of integers j such that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230128160005443-0196:S0004972722000259:S0004972722000259_eqnu26.png?pub-status=live)
and let
$m_j$
to be the minimum of
$[(1+T^{-1})^{\hspace{2pt}j},(1+T^{-1})^{\hspace{2pt}j+1}]\bigcap \mathscr {M}$
for j in
$\mathscr {J}$
. Consider the set
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230128160005443-0196:S0004972722000259:S0004972722000259_eqnu27.png?pub-status=live)
and define
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230128160005443-0196:S0004972722000259:S0004972722000259_eqnu28.png?pub-status=live)
Finally, we set
$\Phi (t)=e^{-t^2/2}$
.
Lemma 2.3. We have
-
(i)
$\lvert R(t)\rvert ^2\leq R(0)^2\ll N\sum _{l\in \mathscr {M}}h(l)^2$ ;
-
(ii)
$\int _{-\infty }^{\infty }\lvert R(t)\rvert ^2\Phi ({t}/{T})\,dt\ll T\sum _{l\in \mathscr {M}}h(l)^2$ .
Proof. The proof for
$(\mathrm {i})$
follows from the definition of
$R(t)$
in (2.3) and the Cauchy–Schwarz inequality. The proof for
$(\mathrm {ii})$
follows the same outline as in [Reference Bondarenko and Seip3, Lemma 5].
Define
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230128160005443-0196:S0004972722000259:S0004972722000259_eqn8.png?pub-status=live)
We make use of the following four lemmas.
Lemma 2.4. We have
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230128160005443-0196:S0004972722000259:S0004972722000259_eqnu29.png?pub-status=live)
Proof. From the construction of h as a multiplicative function,
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230128160005443-0196:S0004972722000259:S0004972722000259_eqn9.png?pub-status=live)
Following the proof of [Reference Bondarenko and Seip2, Lemma 1], (1.2) and the definitions of P in (2.4) and
$\mathscr {X}$
in (2.5) lead to
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230128160005443-0196:S0004972722000259:S0004972722000259_eqn10.png?pub-status=live)
Inserting (2.7) into (2.6) completes the proof of the lemma.
Lemma 2.5 [Reference Bondarenko and Seip2, Lemma 3].
We have
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230128160005443-0196:S0004972722000259:S0004972722000259_eqnu30.png?pub-status=live)
where the implicit constant depends only on
$\varepsilon $
.
Lemma 2.6 [Reference Bondarenko and Seip2, Lemma 2].
We have
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230128160005443-0196:S0004972722000259:S0004972722000259_eqnu31.png?pub-status=live)
Lemma 2.7. Suppose that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230128160005443-0196:S0004972722000259:S0004972722000259_eqnu32.png?pub-status=live)
is absolutely convergent and that
$a_n\geq 0$
for every n. Let
$\varepsilon $
be a positive number and
$\gamma $
be the parameter defining the set P. Then
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230128160005443-0196:S0004972722000259:S0004972722000259_eqnu33.png?pub-status=live)
Proof. It follows from the explicit expression for
$R(t)$
that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230128160005443-0196:S0004972722000259:S0004972722000259_eqn11.png?pub-status=live)
Here we used the fact that
$A(k)\geq 1$
for
$k\in \mathscr {M}$
by the construction of
$\mathscr {M}$
.
For a given k in
$\mathscr {M}$
, consider all pairs
$m'$
,
$n'$
in
$\mathscr {M}'$
such that
$\lvert km'/n'-1\rvert \leq 3/T$
. We use the notation
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230128160005443-0196:S0004972722000259:S0004972722000259_eqnu34.png?pub-status=live)
where j is the unique integer such that
$(1+T^{-1})^{\hspace{2pt}j}\leq m'\leq (1+T^{-1})^{\hspace{2pt}j+1}$
. Using the Cauchy–Schwarz inequality and the definition of
$r(m')$
, we find
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230128160005443-0196:S0004972722000259:S0004972722000259_eqnu35.png?pub-status=live)
and hence, by the definition of
$\mathscr {M}'$
,
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230128160005443-0196:S0004972722000259:S0004972722000259_eqnu36.png?pub-status=live)
Now dividing this inequality by
$\sqrt {k}$
and summing over all k in
$\mathscr {M}\cap [1,T^{\varepsilon }]$
and combining the result with (2.8), and Lemmas 2.5 and 2.6, we get
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230128160005443-0196:S0004972722000259:S0004972722000259_eqn12.png?pub-status=live)
Combining Lemma 2.4 and (2.9) completes the proof of the lemma.
3 Proof of Theorem 1.1
We choose
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230128160005443-0196:S0004972722000259:S0004972722000259_eqn13.png?pub-status=live)
and note that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230128160005443-0196:S0004972722000259:S0004972722000259_eqn14.png?pub-status=live)
By the convexity bound [Reference Iwaniec and Kowalski8, (5.21)] and the growth estimate for
$F(x+iy)$
,
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230128160005443-0196:S0004972722000259:S0004972722000259_eqn15.png?pub-status=live)
By Lemma 2.2,
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230128160005443-0196:S0004972722000259:S0004972722000259_eqn16.png?pub-status=live)
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230128160005443-0196:S0004972722000259:S0004972722000259_eqn17.png?pub-status=live)
by a trival estimation of
$R(0)^2$
in Lemma 2.3. Because of the rapid decay of
$\Phi (t)$
,
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230128160005443-0196:S0004972722000259:S0004972722000259_eqn18.png?pub-status=live)
Combining (3.5) and (3.6), we deduce that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230128160005443-0196:S0004972722000259:S0004972722000259_eqn19.png?pub-status=live)
We now require
$\delta +\kappa <1$
and apply Lemma 2.3(ii) to the left-hand side of (3.7). We obtain
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230128160005443-0196:S0004972722000259:S0004972722000259_eqn20.png?pub-status=live)
By Lemma 2.1,
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230128160005443-0196:S0004972722000259:S0004972722000259_eqn21.png?pub-status=live)
Setting
$a_m:=\widehat {F}(\log m)$
and applying Lemma 2.7,
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230128160005443-0196:S0004972722000259:S0004972722000259_eqn22.png?pub-status=live)
Applying (3.1) and Lemma 2.3(i),
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230128160005443-0196:S0004972722000259:S0004972722000259_eqn23.png?pub-status=live)
In view of (3.2), we note that
$\min _{m\leq T^{\varepsilon }}\widehat {F}(\log m)\geq \pi /4$
. Hence, choosing
$\varepsilon $
small enough and combining (3.8)–(3.11), we find that the asserted bound (1.3) holds for some t satisfying
$T^{\delta }/2\leq t\leq 2T\log T$
. We obtain the desired restriction
$T^{\delta }\leq t\leq T$
after a trivial adjustment, changing T to
$T/(2\log T)$
and making
$\delta $
slightly smaller.
Acknowledgement
The authors are grateful to Xuanxuan Xiao for drawing their attention to the problem considered in this paper.