Search arXivSearch

arXiv · 1801.02283

Computing the average root number of an elliptic surface

Abstract

By considering a one-parameter family of elliptic curves defined over $\mathbb{Q}$, we might ask ourselves if there is any bias in the distribution (or parity) of the root numbers at each specialization. From the work of Helfgott, we know (at least conjecturally) that the average root number of an elliptic curve defined over $\mathbb{Q}(T)$ is zero as soon as there is a place of multiplicative reduction over $\mathbb{Q}(T)$ other than $-$deg. Recently, Helfgott's work was extended by Desjardins, where she relaxes some of Helfgott's hypotheses and is able to provide unconditional results on the variation of the root number for many elliptic surfaces. In this paper, we are concerned with elliptic curves defined over $\mathbb{Q}(T)$ with no place of multiplicative reduction over $\mathbb{Q}(T)$, except possibly at $-$deg. More precisely, we will use the work of Helfgott to compute the average root number of an explicit family of elliptic curves defined over $\mathbb{Q}$ and show that this family is "parity-biased" infinitely-often.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jake Chinis. 2018-01-08. Computing the average root number of an elliptic surface. https://arxiv.org/abs/1801.02283

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