Search arXivSearch

arXiv · 1610.07440

On the variation of the root number in families of elliptic curves

Abstract

We show the density of rational points on non-isotrivial elliptic surfaces by studying the variation of the root numbers among the fibers of these surfaces, conditionally to two analytic number theory conjectures (the squarefree conjecture and Chowla's conjecture). This is a weaker statement than the one found in a preprint of Helfgott which proves (under the same assumptions) that the average root number is $0$ when the surface admits a place of multiplicative reduction. However, we use a different technique. The conjectures involved impose a restriction on the degree of the irreducible factors of the discriminant of the surfaces. Moreover, we manage to drop the squarefree conjecture assumption under some technical hypotheses, and show thus unconditionally the variation of the root number on many elliptic surfaces, without imposing a bound for the degree of the irreducible factors. Under the parity conjecture, this guarantees the density of the rational points on these surfaces.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Julie Desjardins. 2018-07-18. On the variation of the root number in families of elliptic curves. https://doi.org/10.1112/jlms.12168

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