Search arXivSearch

arXiv · 1407.3099

Conjectures for the integral moments and ratios of L-functions over function fields

Abstract

We extend to the function field setting the heuristic previously developed, by Conrey, Farmer, Keating, Rubinstein and Snaith, for the integral moments and ratios of $L$-functions defined over number fields. Specifically, we give a heuristic for the moments and ratios of a family of $L$-functions associated with hyperelliptic curves of genus $g$ over a fixed finite field $\mathbb{F}_{q}$ in the limit as $g\rightarrow\infty$. Like in the number field case, there is a striking resemblance to the corresponding formulae for the characteristic polynomials of random matrices. As an application, we calculate the one-level density for the zeros of these $L$-functions.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

J. C. Andrade, J. P. Keating. 2014-07-11. Conjectures for the integral moments and ratios of L-functions over function fields. https://doi.org/10.1016/j.jnt.2014.02.019

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