Search arXivSearch

arXiv · 2506.07967

Improving elliptic curve rank classification using multi-value and learned Mestre-Nagao sums

Abstract

Determining the rank of an elliptic curve E/Q remains a central challenge in number theory. Heuristics such as Mestre--Nagao sums are widely used to estimate ranks, but there is considerable room for improving their predictive power. This paper introduces two novel methods for enhancing rank classification using Mestre--Nagao sums. First, we propose a ``multi-value'' approach that simultaneously uses two distinct sums, S_0 and S_5, evaluated over multiple ranges. This multi-sum perspective significantly improves classification accuracy over traditional single-sum heuristics. Second, we employ machine learning -- specifically deep neural networks -- to learn optimal, potentially conductor-dependent weightings for Mestre--Nagao sums directly from data. Our results indicate that adaptively weighted sums offer a slight edge in rank classification over traditional methods.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Zvonimir Bujanović, Matija Kazalicki, Domagoj Vlah. 2025-06-09. Improving elliptic curve rank classification using multi-value and learned Mestre-Nagao sums. https://arxiv.org/abs/2506.07967

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