Search arXivSearch

arXiv · 1510.03980

Elliptic curves over a finite field and the trace formula

Abstract

We prove formulas for power moments for point counts of elliptic curves over a finite field $k$ such that the groups of $k$-points of the curves contain a chosen subgroup. These formulas express the moments in terms of traces of Hecke operators for certain congruence subgroups of $\operatorname{SL}_2(\mathbb{Z})$. As our main technical input we prove an Eichler-Selberg trace formula for a family of congruence subgroups of $\operatorname{SL}_2(\mathbb{Z})$ which include as special cases the groups $Γ_1(N)$ and $Γ(N)$. Our formulas generalize results of Birch and Ihara (the case of the trivial subgroup, and the full modular group), and previous work of the authors (the subgroups $\mathbb{Z}/2\mathbb{Z}$ and $(\mathbb{Z}/2\mathbb{Z})^2$ and congruence subgroups $Γ_0(2),Γ_0(4)$). We use these formulas to answer statistical questions about point counts for elliptic curves over a fixed finite field, generalizing results of Vlǎduţ, Gekeler, Howe, and others.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Nathan Kaplan, Ian Petrow. 2017-08-08. Elliptic curves over a finite field and the trace formula. https://doi.org/10.1112/plms.12069

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