Search arXivSearch

arXiv · 1510.01219

Improved subconvexity bounds for GL(2)xGL(3) and GL(3) L-functions by weighted stationary phase

Abstract

Let $f$ be a fixed self-contragradient Hecke-Maass form for $SL(3,\mathbb Z)$, and $u$ an even Hecke-Maass form for $SL(2,\mathbb Z)$ with Laplace eigenvalue $1/4+k^2$, $k>0$. A subconvexity bound $O\big(k^{4/3+\varepsilon}\big)$ in the eigenvalue aspect is proved for the central value at $s=1/2$ of the Rankin-Selberg $L$-function $L(s,f\times u)$. Meanwhile, a subconvexity bound $O\big((1+|t|)^{2/3+\varepsilon}\big)$ in the $t$ aspect is proved for $L(1/2+it,f)$. These bounds improved corresponding subconvexity bounds proved by Xiaoqing Li (Annals of Mathematics, 2011). The main technique in the proof, other than those used by Li, is an $n$th-order asymptotic expansion of a weighted stationary phase integral, for arbitrary $n\geq1$. This asymptotic expansion sharpened the classical result for $n=1$ by Huxley.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Mark McKee, Haiwei Sun, Yangbo Ye. 2017-04-11. Improved subconvexity bounds for GL(2)xGL(3) and GL(3) L-functions by weighted stationary phase. https://doi.org/10.1090/tran%2F7159

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Asymptotic density of k-almost primes

Landau's well known asymptotic formula $$N_k(x):=\ \mid\{n\leq x : Ω(n)=k\}\mid \ \sim \left( \frac{x}{\log x} \right) \frac{(\log\log x)^{k-1}}{(k - 1)!}\ \ (x \rightarrow \infty),$$ which also holds for $$π_k(x):=\ \mid\{n\leq x : ω(n)=k\}\mid,$$ is known to be fairly poor for $k > 1$, and when $k$ is allowed to tend to infinity with $x$, the study of $N_k(x)$ and $π_k(x)$ becomes very technical [1, Chapter II.6, $§$ 6.1, p.200]. I hope to show that the method described below provides not only a more accurate approach, but rather increases in its asymptotic accuracy as $k$ tends to infinity.

math.NT

Transcendence Meets Normality: Construction of Transcendentally Normal Numbers

In this work, we study real numbers $x$ for which $p(x)$ is (absolutely) normal for every non-constant integer-valued polynomial $p$. We call such numbers transcendentally normal. We prove that almost every real number is transcendentally normal and provide an explicit construction of such a number, based on Sierpinski's covering method and novel ideas involving the so-called stretch function. In the next step, we transform this construction into an algorithm that computes the digits of a t-normal number recursively in all integer bases. Moreover, we extend our covering approach to construct and compute LIL-normal numbers whose discrepancies are of the order predicted by the law of the iterated logarithm. We also take the opportunity to discuss several interesting open problems.

math.NT