Search arXivSearch

arXiv · 2110.12156

$L$-Functions of Elliptic Curves Modulo Integers

Abstract

In 1985, Schoof devised an algorithm to compute zeta functions of elliptic curves over finite fields by directly computing the numerators of these rational functions modulo sufficiently many primes (see \cite{schoof_1985}). If $E/K$ is an elliptic curve with nonconstant $j$-invariant defined over a function field $K$ of characteristic $p \geq 5$, we know that its $L$-function $L(T,E/K)$ is a polynomial in $\mathbb{Z}[T]$ (see \cite[p.11]{katz_2002}). Inspired by Schoof, we study the reduction of $L(T,E/K)$ modulo integers. We obtain three main results. Firstly, if $E/K$ has non-trivial $K$-rational $N$-torsion for some integer $N$ coprime with $p$, we extend a formula for $L(T,E/K) \bmod N$ due to Hall (see \cite[p.133, Theorem 4]{hall_2006}) to all quadratic twists $E_f/K$ with $f \in K^\times \smallsetminus K^{\times 2}$. Secondly, without any condition on the $2$-torsion subgroup of $E(K)$, we give a formula for the quotient modulo $2$ of $L$-functions of any two quadratic twists of $E/K$. Thirdly, we use these results to compute the global root numbers of an infinite family of quadratic twists of an elliptic curve and in most cases find the exact analytic rank of each of these twists. We also illustrate that in favourable situations our second main result allows one to compute much more efficiently $L(T,E_f/K) \bmod 2$ than an algorithm of Baig and Hall (see \cite{baig_hall_2012}). Finally, we use our formulas to compute directly some degree $2$ $L$-functions.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Félix Baril Boudreau. 2022-11-30. $L$-Functions of Elliptic Curves Modulo Integers. https://doi.org/10.1016/j.jnt.2023.09.013

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