Search arXivSearch

arXiv · 1309.1027

One-level density of families of elliptic curves and the Ratios Conjectures

Abstract

Using the ratios conjectures as introduced by Conrey, Farmer and Zirnbauer, we obtain closed formulas for the one-level density for two families of L-functions attached to elliptic curves. From those closed formulas, we can determine the underlying symmetry types of the families. The one-level scaling density for the first family corresponds to the orthogonal distribution as predicted by the conjectures of Katz and Sarnak, and the one-level scaling density for the second family is the sum of the Dirac distribution and the even orthogonal distribution. This seems to be a new phenomenon, caused by the fact that the curves of the second families have odd rank. Then, there is a trivial zero at the central point which accounts for the Dirac distribution, and also affects the remaining part of the scaling density which is then (maybe surprisingly) the even orthogonal distribution. The one-level density for this second family was studied in the past for test functions with Fourier transforms of small support, but since the Fourier transforms of the even orthogonal and odd orthogonal distributions are undistinguishable for small support, it was not possible to identify the distribution with those techniques. This can be done with the ratios conjectures, and it sheds more light on "independent" and "non-independent" zeroes and the repulsion phenomenon.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Chantal David, Duc Khiem Huynh, James Parks. 2013-09-04. One-level density of families of elliptic curves and the Ratios Conjectures. https://arxiv.org/abs/1309.1027

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