An unconditional $\mathrm{GL}(n)$ large sieve
Jesse Thorner, Asif Zaman

TL;DR
This paper establishes new unconditional large sieve inequalities for automorphic representations of GL(n), leading to zero density estimates and subconvexity bounds for associated L-functions, advancing understanding in automorphic forms and number theory.
Contribution
It introduces the first unconditional large sieve inequalities for GL(n) automorphic representations on integers and primes, and derives zero density and subconvexity results.
Findings
Unconditional large sieve inequalities for Hecke eigenvalues on integers and primes.
First unconditional zero density estimate for GL(n) automorphic L-functions.
Hybrid subconvexity bounds for L(1/2, π) for a density one subset of representations.
Abstract
Let be the set of all cuspidal automorphic representations of over a number field with unitary central character. We prove two unconditional large sieve inequalities for the Hecke eigenvalues of , one on the integers and one on the primes. The second leads to the first unconditional zero density estimate for the family of -functions associated to , which we make log-free. As an application of the zero density estimate, we prove a hybrid subconvexity bound for for a density one subset of .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
\newconstantfamily
abconsymbol=c
An unconditional large sieve
Jesse Thorner
Department of Mathematics, University of Illinois, Urbana, IL 61801
and
Asif Zaman
Department of Mathematics, University of Toronto, Toronto, Ontario, Canada M5S 2E4
Abstract.
Let be the set of cuspidal automorphic representations of over a number field with unitary central character. We prove two unconditional large sieve inequalities for the Hecke eigenvalues of , one on the integers and one on the primes. The second leads to the first unconditional zero density estimate for the family of -functions associated to , which we make log-free. As an application of the zero density estimate, we prove a hybrid subconvexity bound for for a density one subset of .
1. Introduction and statement of the main results
Let be the ring of adeles over a number field with ring of integers , absolute norm , and absolute discriminant . For an integer , let be the universal family of all cuspidal automorphic representations of with unitary central character, which is normalized to be trivial on the diagonally embedded copy of the positive reals so that is discrete (see [4, Corollary 9]). To each , Iwaniec and Sarnak [17] associate an analytic conductor measuring the arithmetic and spectral complexity of (see (2.2)). We consider the truncated family . For , let be the arithmetic conductor, and let be the standard -function of . Here, is the Hecke eigenvalue of at a nonzero integral ideal of .
If and , then corresponds with a primitive Dirichlet character to modulus with , and . For the discussion that follows, we abuse notation and write . The classical large sieve inequality for Dirichlet characters states that if and is a function, then
[TABLE]
(See [16, (7.31)].) This improves on the trivial bound that follows from the Cauchy–Schwarz inequality. The large sieve serves as a quasi-orthogonality statement for characters to varying moduli, leading to powerful substitutes for the generalized Riemann hypothesis (GRH) for Dirichlet -functions like the Bombieri–Vinogradov theorem. When or , minor changes to work of Duke and Kowalski [11, Section 4] show that if , , and is a complex-valued function on the integral ideals of , then under the generalized Ramanujan conjecture (GRC) (which implies that ), we have
[TABLE]
For , Brumley [5, Corollary 3] unconditionally proved (1.2) with . For , his proof uses the automorphy of the exterior square lift from to [20]. The ideas in [16, Section 7.1] suggest that one can replace with 1, matching (1.1).
We prove a variant of (1.2) which holds for all without recourse to unproven progress towards GRC. This appears to be the first unconditional large sieve for when .
Theorem 1.1**.**
Fix , . If and is a complex-valued function, then
[TABLE]
Remarks*.*
There exists a constant such that for all , we have the bounds
[TABLE]
Brumley, Thorner, and Zaman [7, Theorem A.1] proved the upper bound. Brumley and Milićević [6, Theorem 1.1] proved the lower bound, which is the expected asymptotic. 2. 2.
Our proof is easily modified to accommodate subfamilies of . 3. 3.
Under GRC and the generalized Lindelöf hypothesis, the improves to . This seems to be the limit of our method. Under GRC alone, the improves to . 4. 4.
See Section 4.1 for an overview of our proof of Theorem 1.1. The ideas are encapsulated in the proof of a new inequality for Dirichlet coefficients of Rankin–Selberg -functions (Proposition 3.1), which might be of independent interest.
We see from (1.3) that Theorem 1.1 is sharp for . Despite this weak range, Theorem 1.1 is useful for studying zeros of -functions. For each , we expect to satisfy the generalized Riemann hypothesis (GRH): if , then . Since GRH remains open, and existing zero-free regions can be limiting in applications, it is useful to show that few zeros of lie near the line . Hence we define
[TABLE]
Corresponding with and , Montgomery [28] proved that if , then
[TABLE]
Thus a vanishingly small proportion of zeros of Dirichlet -functions lie near . As part of his proof that the least prime is at most (GRH replaces with ), Linnik [24] developed powerful results for the distribution of zeros of Dirichlet -functions, including a log-free zero density estimate. Gallagher [13] and Jutila [19] unified the work of Montgomery and Linnik. Jutila proved that if , then for all ,
[TABLE]
Kowalski and Michel [21, Theorem 2] extended Jutila’s work using the ideas of Duke and Kowalski. For , it follows from the work in [21] that if each satisfies111In fact, they only require (at the cost of a larger exponent) that for some fixed , where is given by (2.4). See Section 4.1. GRC, then for some constant , we have that (see also [1])
[TABLE]
Much like (1.5) and (1.6), an estimate such as (1.7) often suffices to prove results (most often on average over families) which are commensurate with what GRH predicts. Using Brumley’s work [5], one can prove (1.7) when without recourse to unproven progress towards GRC (with a worse exponent). We refine Theorem 1.1 for restricted to prime ideals of large norm (see Theorem 4.2) to prove the first unconditional zero density estimate for the sum in (1.7), which we make log-free using the ideas of Gallagher [13] and Soundararajan and Thorner [32] rather than [19, 21].
Theorem 1.2**.**
Fix . If is given by (1.4), then for and ,
[TABLE]
Remark*.*
Theorem 1.1, along with the ideas in [28], leads to a density estimate that is not log-free but has a much smaller exponent. The log-free estimate is much more delicate.
We now describe an application of Theorem 1.2. For , we seek bounds for in terms of . The generalized Lindelöf hypothesis (a corollary of GRH) asserts that for any . When (only for convenience), Soundararajan and Thorner [32, Corollary 2.7] proved an unconditional log-free zero density estimate for an individual , from which the bound
[TABLE]
follows. Subconvexity bounds of the shape for some constant are important in many equidistribution problems. See [17, 26] for further discussion and [2, 10, 14, 23, 27, 30, 36] for a sample of some amazing progress.
When and , an application of (1.1) using the approximate functional equation [16, Section 5.2] shows that a density one subset of Dirichlet -functions satisfy the generalized Lindelöf hypothesis (see [16, Theorem 7.34], for example). We cannot adapt this approach to obtain a power-savings over (1.8) for a density one subset of using Theorem 1.1 because of the poor -dependence and the condition , which we do not know how to remove (see Section 4). Instead, we use Theorem 1.2 and the bound
[TABLE]
for all , which follows from [32, Theorem 1.1] with minor changes for .
Theorem 1.3**.**
If and , then for all except of the .
On the same day that this paper was first posted, Blomer [3, Theorem 4, Corollary 5] posted a preprint showing that if is the set of corresponding to Hecke–Maaß forms over of arithmetic conductor and Laplace eigenvalue in , then
[TABLE]
once with a sufficiently small implied constant. This improves on work of Venkatesh [35]. Note that (1.10) holds for of a given large arithmetic conductor and small eigenvalue, while Theorem 1.1 holds as the arithmetic conductor and eigenvalue vary with essentially no constraint. One cannot sum (1.10) over to recover a result like Theorem 1.1. Also, note that Theorem 1.1 and (1.10) are sharp in complementary ranges. The approximate functional equation for and (1.10) imply that for , all except of the satisfy . Theorem 1.3 furnishes a much smaller hybrid-aspect power-savings over (1.8) for all outside of a much smaller exceptional set.222A few months after this paper was first posted, Jana [18, Theorems 5 and 6] proved a variant of Blomer’s results in [3] in the analytic conductor aspect for automorphic forms on , all of which have arithmetic conductor . One could similarly contrast our work with his.
Notation
The expressions and mean that there exists an effectively computable constant , depending at most on , such that . The expression means that there exists a sufficiently large effectively computable constant , depending at most on , such that . Sufficiency will depend on context. We write and for the GCD and LCM of two integral ideals and .
Overview of the paper
In Section 2, we recall basic properties of standard and Rankin–Selberg -functions. In Section 3, we provide an explicit description of the coefficients of such -functions in terms of and . We use these explicit descriptions to prove Proposition 3.1. In Section 4, after outlining our strategy in Section 4.1, we use these explicit descriptions to prove the large sieve inequalities in Theorems 1.1 and 4.2. In Section 5, we use Theorem 4.2 along with the ideas in [32] to prove Theorems 1.2 and 1.3.
Acknowledgements
We thank Nickolas Andersen, Farrell Brumley, and Peter Humphries for helpful discussions. We especially thank Kannan Soundararajan, who showed us how our idea for Theorem 1.1 leads to Proposition 3.1, and the anonymous referees for their thorough suggestions and comments. Work on this paper began while the authors were postdoctoral researchers at Stanford University. Jesse Thorner was partially supported by an NSF Postdoctoral Fellowship. Asif Zaman was partially supported by an NSERC fellowship.
2. Properties of -functions
We recall some standard facts about -functions arising from automorphic representations and their Rankin-Selberg convolutions; see [4, 26] for convenient summaries.
2.1. Standard -functions
Given , let be the contragredient representation. Let be the arithmetic conductor of . We have . We express as a tensor product of smooth admissible representations of , where varies over places of . For each nonarchimedean place , there prime ideal corresponding to a non-archimedean place, we define in terms of the Satake parameters by
[TABLE]
We have for all whenever , and it might be the case that for some when . The standard -function associated to is of the form
[TABLE]
The Euler product and Dirichlet series converge absolutely when . We have the equality of sets . At each archimedean place of , there are Langlands parameters from which we define
[TABLE]
We have the equality of sets . Let if and if . We define for the analytic conductor
[TABLE]
Let , which is 1 if is trivial and 0 otherwise. The completed -function is entire of order 1. Each pole of is a trivial zero of . Since is entire of order 1, a Hadamard factorization
[TABLE]
exists, where varies over the nontrivial zeros of . These zeros satisfy .
There exists such that for all pairs and , we have (see [25, 29])
[TABLE]
The generalized Selberg conjecture and GRC assert that in (2.4), one may take .
2.2. Rankin–Selberg -functions
Let and . Define
[TABLE]
for suitable complex numbers . If , then we have the equality of sets
[TABLE]
See Brumley [32, Appendix] for a description of when . The Rankin-Selberg -function associated to and is of the form
[TABLE]
At an archimedean place , we define from the Langlands parameters
[TABLE]
Let be the arithmetic conductor of , and let
[TABLE]
By our normalization for the central characters of and , we have that and if and only if . Otherwise, we have , and the nonnegativity of when implies that (see Corollary 3.2 below). The completed -function is entire of order 1, and hence possesses a Hadamard product. Since (2.7) converges absolutely for , it follows that and .
As with , we define
[TABLE]
The work of Bushnell and Henniart [9, Theorem 1] and Brumley [15, Lemma A.2] yields
[TABLE]
For all , Li’s bound [22, Theorem 2] and the Phragmén–Lindelöf principle yield
[TABLE]
If and , then the left hand side of (2.10) is viewed as a limit as .
3. Rankin–Selberg combinatorics
A partition is a sequence of nonincreasing nonnegative integers with finitely many nonzero entries. For a partition , let be the number of , and let . For a set and a partition with , let
[TABLE]
be the Schur polynomial associated to . If , then is identically one. By convention, if , then is identically zero.
Let , , and . Cauchy’s identity [8, (38.1)] implies that
[TABLE]
and
[TABLE]
where the sum ranges over all partitions. The above identities, (2.1), and (2.5) yield
[TABLE]
For an integral ideal with prime factorization (where for all but finitely many prime ideals ), the multiplicativity of tells us that
[TABLE]
Similarly, if , then
[TABLE]
Here, denotes a sequence of partitions indexed by prime ideals and
[TABLE]
It is important to note that .
We use (3.1) and (3.2) to prove a new inequality for Rankin–Selberg Dirichlet coefficients.
Proposition 3.1**.**
If and have conductors and , then
[TABLE]
Proof.
Let satisfy , and let . By (3.1),
[TABLE]
Since , it follows from nonnegativity that
[TABLE]
Once we expand the squares on both sides of the inequality, we apply (3.2) to deduce that
[TABLE]
Hence the binary quadratic form given by
[TABLE]
is positive-semidefinite and has a nonpositive discriminant. The result follows. ∎
Corollary 3.2**.**
If has conductor and , then .
Proof.
Since from the above proof is positive-semidefinite, we have . ∎
Remark*.*
While the conclusion of Corollary 3.2 is not new, the proof here appears to be new.
4. Proof of Theorem 1.1
4.1. Overview of the strategy
We quickly recall the strategy of Duke and Kowalski in [11] for proving (1.2). Let be an arbitrary function. By the duality principle for bilinear forms, the bound (1.2) is equivalent to the bound
[TABLE]
One expands the square on the left and swap the order of summation, arriving at
[TABLE]
The bound (4.1) now follows from the expected analytic continuation of the Dirichlet series in the integral, which we now describe. When is large, there holds
[TABLE]
(When and , the identity is classical. Here, is the Dedekind zeta function of ). Minor adjustments to the proof of [11, Proposition 2] show that each Euler factor at for is holomorphic when . This analytically continues to this region and produces the bound
[TABLE]
for some constant depending at most on . This allows us to push the contour into the critical strip when for some fixed . Then (1.2) holds with . Under GRC, we make take . When , Brumley [5] established these results (with replacing ) without recourse to unproven progress towards GRC.
The proof of Proposition 3.1 epitomizes our strategy for Theorem 1.1. We begin our proof by rewriting (4.1) using (3.1), expressing as a product of Schur polynomials associated to a particular partition in . By nonnegativity, we may “complete the sum” by embedding (4.1) into a sum over all partitions in , exactly as in (3.3). Only then do we expand the square and swap the order of summation; now, instead of encountering sums of as Duke and Kowalski did, we encounter sums over because of (3.2). This allows us to work directly with instead of , which removes the source of unproven hypotheses in the work of Duke and Kowalski. In preparation for Theorem 1.2, we also prove a refinement of Theorem 1.1 when is supported on prime ideals of large norm. This involves a delicate synthesis of the large sieve with different Selberg sieve weights for each individual .
4.2. An unconditional large sieve inequality
We begin with a preliminary lemma. Let be a smooth test function which is supported in a compact subset of , and let
[TABLE]
be its Laplace transform. Then is an entire function of , and for any integer ,
[TABLE]
For any , , and , it follows from Laplace inversion that
[TABLE]
Lemma 4.1**.**
Fix a test function as above. Let . Let , let be a nonzero integral ideal, and define
[TABLE]
If , is squarefree, , and is given by (2.8), then
[TABLE]
Proof.
We follow [32, Lemma 6.1]. The result is trivial for . For , define , so that once we push the contour to , the desired sum equals
[TABLE]
It follows (2.10) that
[TABLE]
Since , it follows from (2.9) that
[TABLE]
Since for all , , and , it follows from (2.5) that for all ,
[TABLE]
(Since , a mild variant of the proof of [37, Lemma 1.13] shows that .) Similarly, the bound holds. The integral is then
[TABLE]
by an application of (4.4). This is bounded as claimed. ∎
For integral ideals and , we define to equal 1 if and zero otherwise.
Theorem 4.2**.**
If , is a complex-valued function, and , then
[TABLE]
If and , then
[TABLE]
Proof.
We present a unified proof for both parts. We begin by constructing Selberg sieve weights for each . Define with . Define
[TABLE]
where is given by (4.5). Let be a real-valued function satisfying
[TABLE]
By (4.8), if , then the condition implies that either or .
It suffices to consider such that . We will estimate the sum
[TABLE]
Define . By the duality principle for bilinear forms [16, Section 7.3], (4.9) is
[TABLE]
By (3.1), (4.10) equals the supremum over with of
[TABLE]
Since , we bound (4.11) by embedding it into the “completed sum”
[TABLE]
Fix a nonnegative smooth function supported on a compact subset of such that for . Then (4.12) is
[TABLE]
We expand the square, swap the order of summation, apply (3.2), and see that (4.13) equals
[TABLE]
We apply Lemma 4.1 with replaced by , so that (4.2) equals
[TABLE]
(The “off-diagonal contribution” arising from the pairs resides in the error term because if and only if .) By [37, Lemma 1.12a], we have the bound for all and all . This bound, along with (4.8) and the inequality of arithmetic and geometric means, implies that (4.15) equals (recall )
[TABLE]
Proceeding as in the formulation of the Selberg sieve in [12, Theorem 7.1], we find that for each , there exists a choice of satisfying (4.8) such that
[TABLE]
Hence (4.16) is
[TABLE]
Since is fixed, (4.3) implies that . Therefore, since , we conclude that
[TABLE]
To prove (4.6), recall that for all , hence
[TABLE]
As mentioned earlier, we have . We combine these estimates with (2.9) and (2.10) to find that for all . Also, for all , we have . Thus (4.6) follows from (4.18) with .
We now prove (4.7). Note that if is a prime ideal with , then . Therefore, if we choose in (4.18) so that unless is prime and , then it suffices to prove that
[TABLE]
Fix . Fix a smooth nonnegative function which is compactly supported in , with for and for . If and , then . By Lemma 4.1 with and , we have
[TABLE]
If is sufficiently small, then . We dyadically subdivide and use (4.20) to obtain (recall that by (2.9) and (2.10))
[TABLE]
Once , we achieve (4.19). ∎
Proof of Theorem 1.1.
Dyadically decompose and sum the contributions from each subinterval using (4.6) and the Cauchy–Schwarz inequality. ∎
Remark*.*
Even with the description of when given by Brumley [32, Appendix], there appears to be no variant of (3.2) when which holds with enough uniformity in and to allow us to remove the condition in Theorem 1.1. Such a removal would eliminate the need work with the unramified Rankin–Selberg -functions, and the term would improve to , even without GRC.
4.3. Mean value estimates for Dirichlet polynomials
The corollary below, whose proof relies on Theorem 4.2, serves as a key component in our proof of Theorem 1.2.
Corollary 4.3**.**
Let . If and , then
[TABLE]
Proof.
A formal generalization of [13, Theorem 1] to number fields tells us that for a complex-valued function supported on the integral ideals of such that ,
[TABLE]
Therefore, if , then
[TABLE]
By (1.3) with , we have . Let and , which ensures that . Let , and define by if and zero otherwise. An application of (4.7) shows that (4.21) is
[TABLE]
This is by [37, Lemma 1.11b], partial summation, and the range of . ∎
5. Proof of Theorems 1.2 and 1.3
Our approach to Theorem 1.2 closely follows the approach in [32], which handles the case of a single over . While we only require minor modifications, our treatment is self-contained apart from a few standard calculations which do not directly pertain to our application of Corollary 4.3 in the proof. For , we define the coefficients by
[TABLE]
We similarly define as the -th Dirichlet coefficient of . We have [32, (A.8) and (A.11)] and [32, Prop. A.1].
5.1. Preliminary lemmas
Suppose that , in which case is entire. Taking logarithmic derivatives of both sides of (2.3), we see that
[TABLE]
Since [16, Proposition 5.7(3)], we have
[TABLE]
Lemma 5.1**.**
If , then
[TABLE]
Proof.
Since , by the above discussion, we find that
[TABLE]
This follows from standard manipulations of the Hadamard product for and (2.9). See [32, Lemma 2.3] for details.∎
Lemma 5.2**.**
If and , then
[TABLE]
and .
Sketch of proof.
These follow from elementary manipulations of (5.2) that use (5.1) to handle . See [32, Lemma 3.1] for details. ∎
5.2. Detecting zeros
Let be an integer, and let
[TABLE]
Let . If is entire, then differentiating (5.1) times, we find that
[TABLE]
Using the Hadamard formulation of and (2.4) to handle the contribution from and Lemma 5.2 to handle the contribution from zeros with , we find that
[TABLE]
If has a zero satisfying (with ), then we will produce upper and lower bounds for the high derivatives of . This leads to a criterion by which we can detect zeros near (see (5.10)). The interplay between the upper and lower bounds will produce the desired zero density estimate. If the sum over zeros in (5.4) is not empty, then we can appeal to the following result of Sós and Turán [31].
Lemma 5.3**.**
Let . If , then there exists an integer such that .
We begin with the lower bound.
Lemma 5.4**.**
Let satisfy , and let satisfy (5.3). If has a zero satisfying and with a sufficiently large implied constant, then for some integer , one has (recall )
[TABLE]
Proof.
By Lemma 5.2, there are zeros satisfying . If , then . Thus we may apply Lemma 5.3. ∎
Suppose now that , where is an absolute constant (to be determined shortly) and the implied constant is sufficiently large. If and has a zero satisfying , then we can combine (5.4) with Lemma 5.4 and determine that for some ,
[TABLE]
We proceed to the upper bound.
Lemma 5.5**.**
Let be entire. Let , let satisfy , and let satisfy (5.3). Let and be integers, and put and . Set . One has that
[TABLE]
Proof.
Since , we have
[TABLE]
It is straightforward to check that when (see [32, Lemma 4.3]). Since by Lemma 5.1, we have
[TABLE]
Let . Consider the composite with . Since for ,
[TABLE]
The above estimate and the bound (2.4) imply that
[TABLE]
The final sum is by [37, Lemma 1.11b] and (5.3), so
[TABLE]
Stronger results hold when , in which case GRC holds (see [33, Section 5]).
Let , so that . Since , it follows by partial summation and Lemma 5.1 that
[TABLE]
The lemma follows from (5.6), (5.7), and (5.2) with the identity . ∎
5.3. Proof of Theorem 1.2
Our work in the Section 5.2 produces an upper bound for the count of zeros of close to the line . See also the proof of [32, Theorem 1.2].
Lemma 5.6**.**
Under the notation and hypotheses of Lemma 5.5, if is an absolute constant and with a sufficiently large implied constant, then
[TABLE]
Proof.
Recall our choice of in (5.3), and let . If is sufficiently large and , then the -term in Lemma 5.5 is . As in Lemma 5.5, let and . If has a zero satisfying , then we combine (5.5) and Lemma 5.6 to conclude our zero detection criterion: if has a zero satisfying , then with our choice of ,
[TABLE]
We square both sides, apply Cauchy–Schwarz, and use Lemma 5.2 to deduce that
[TABLE]
To finish, we integrate over and observe that . ∎
We use Corollary 4.3 and Lemma 5.6 to prove Theorem 1.2.
Proof of Theorem 1.2.
First, let so that if , then is entire. Choose with a sufficiently large implied constant. Recall from (5.3) and the choices of and . We sum (5.9) over to find that
[TABLE]
We apply Corollary 4.3 with to deduce that (5.11) is . Using our choices of and and writing , we conclude that
[TABLE]
If , then
[TABLE]
On the other hand, if , then our estimate is trivial since for each by [16, Theorem 5.8].
When , our arguments do not change except that we omit the trivial representation, whose -function is (which is not entire). This -function contributes negligibly since by [34, Theorem 4.5]. This completes the proof. ∎
Proof of Theorem 1.3.
Let . If , then by (1.3). Theorem 1.2 implies that for all except of the . Since by (2.4), the theorem follows from (1.9). ∎
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] C. An. Log-free zero density estimates for automorphic l 𝑙 l -functions, Apr. 2020. ar Xiv:2004.14410.
- 2[2] V. Blomer. Subconvexity for twisted L 𝐿 L -functions on GL ( 3 ) GL 3 {\rm GL}(3) . Amer. J. Math. , 134(5):1385–1421, 2012.
- 3[3] V. Blomer. Density theorems for GL(n). ar Xiv e-prints , page ar Xiv:1906.07459, June 2019.
- 4[4] F. Brumley. Effective multiplicity one on GL N subscript GL 𝑁 {\rm GL}_{N} and narrow zero-free regions for Rankin-Selberg L 𝐿 L -functions. Amer. J. Math. , 128(6):1455–1474, 2006.
- 5[5] F. Brumley. Second order average estimates on local data of cusp forms. Arch. Math. (Basel) , 87(1):19–32, 2006.
- 6[6] F. Brumley and D. Milićević. Counting cusp forms by analytic conductor. ar Xiv e-prints , page ar Xiv:1805.00633, May 2018.
- 7[7] F. Brumley, J. Thorner, and A. Zaman. Zeros of Rankin–Selberg L 𝐿 L -functions at the edge of the critical strip. ar Xiv e-prints , page ar Xiv:1804.06402, Apr 2018.
- 8[8] D. Bump. Lie groups , volume 225 of Graduate Texts in Mathematics . Springer, New York, second edition, 2013.
