Search arXivSearch

arXiv · 1612.09359

Super-positivity of a family of L-functions

Abstract

Zhiwei Yun and Wei Zhang introduced the notion of "super-positivity of self dual L-functions" which specifies that all derivatives of the completed L-function (including Gamma factors and power of the conductor) at the central value $s = 1/2$ should be non-negative. They proved that the Riemann hypothesis implies super-positivity for self dual cuspidal automorphic L-functions on $GL(n)$. Super-positivity of the Riemann zeta function was established by Pólya in 1927 and since then many other cases have been found by numerical computation. In this paper we prove, for the first time, that there are infinitely many L-functions associated to modular forms for $SL(2, \mathbb{Z})$ each of which has the super-positivity property. Our proof also establishes that all derivatives of the completed L-function at any real point $σ> 1/2$ must be positive.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Dorian Goldfeld, Bingrong Huang. 2017-07-11. Super-positivity of a family of L-functions. https://arxiv.org/abs/1612.09359

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