SearcharxivSearch

arXiv · 2509.03129

Unveiling Arithmetic Statistics of Congruent Number Elliptic Curves via Data Science and Machine Learning

Abstract

This article presents a comprehensive data-scientific investigation into the arithmetic statistics of congruent number elliptic curves, leveraging a dataset of square-free integers up to $3$ million. We analyze the Mordell-Weil ranks, 2-Selmer ranks, and 3-Selmer ranks of the corresponding elliptic curves $E_D: y^2 = x^3 - D^2x$, where $D$ is a square-free number. Our study empirically examines the Heath-Brown heuristics, which predict the distribution of $2$-Selmer ranks as well as congruent numbers based on their residue modulo $8$. In particular, offering statistical insights into the proportion of numbers whose associated elliptic curves have positive rank. We provide a rigorous verification of Goldfeld's Conjecture in this context, analyzing the distribution of analytic ranks and demonstrating their alignment with the conjectured $50/50$ split for ranks $0$ and $1$. Furthermore, we explore the conjectural asymptotic distribution of $2-$ and $3$-torsion part of the Tate-Shafarevich group of these curves. Based on empirical evidence, we also suggest potential statistical distribution of $3$-Selmer and Mordell-Weil ranks. We also examine the averages of Frobenius traces and observe that they tend to zero without exhibiting any murmuration-like patterns. In addition to these number-theoretic analyses, we apply machine learning techniques to classify and predict congruent numbers, exploring the efficacy of computational methods in distinguishing congruent from non-congruent numbers based on the arithmetic properties of elliptic curves. This interdisciplinary approach blends advanced number theory with modern data science, providing empirical support for conjectures as well as discovery of new patterns.

Explore related subjects

Keep this discovery

BibTeXRIS

Priyavrat Deshpande, Aditya Karnataki, Pratiksha Shingavekar. 2025-09-03. Unveiling Arithmetic Statistics of Congruent Number Elliptic Curves via Data Science and Machine Learning. https://arxiv.org/abs/2509.03129

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Ordinary 3-Isogeny Graphs and Improvement of Supersingularity Testing for Twisted Hessian Curves over Prime Fields

For any primes $p \neq \ell$, $\ell$-isogeny graphs of ordinary elliptic curves defined over $\mathbb{F}_{p^2}$ have a typical structure called $\ell$-volcanoes, and the structure is the core of Sutherland's supersingularity testing algorithm for elliptic curves. In this paper, by exploiting the properties of $3$-isogenies between twisted Hessian curves, we show that when $p \equiv 2 \pmod{3}$ and $\ell = 3$, every ordinary twisted Hessian curve defined over $\mathbb{F}_p$ lies on the surface of the $3$-volcano. As an application, we give an improved version of Sutherland's supersingularity testing algorithm specialized to twisted Hessian curves defined over $\mathbb{F}_p$ with $p \equiv 2 \pmod{3}$. We also give a generalization of the known fact that any supersingular $j$-invariant is a cube in $\mathbb{F}_{p^2}$; we show that for any twisted Hessian curve $H(a,d)$ defined over $\mathbb{F}_{p^2}$, its $j$-invariant is not a cube in $\mathbb{F}_{p^2}$ if and only if $H(a,d)$ is ordinary and lies on the floor of a $3$-volcano.

math.NT

Effective estimates for exponential sums with multiplicative coefficients

Let $f$ be multiplicative, with $|f(p)|\le A$ at primes and $\sum_{n\le x}|f(n)|^2\le A^2x$ for every $x\ge1$. If $|\alpha-a/q|\le q^{-2}$, $(a,q)=1$, and $3\le R\le q\le N/R$, we prove \[ \sum_{n\le N}f(n)\operatorname{e}(n\alpha) \ll_A \frac{N}{\log N} +\frac{N}{\sqrt R}\sqrt{\log\log(3R)} \] with effective implied constants. Montgomery and Vaughan proved this with second term $NR^{-1/2}(\log R)^{3/2}$, and, for $1$-bounded functions, Bachman replaced it by $NR^{-1/2}\sqrt{\log R\log\log R}$. We remove the factor $\sqrt{\log R}$ from Bachman's second term while retaining the original coefficient hypotheses of Montgomery and Vaughan. A more precise estimate records the distance from a rational number. The proof combines the Brun-Titchmarsh inequality on short intervals with maximal Fourier estimates derived from the Carleson-Hunt theorem; the local bounds permit arbitrary prime-dependent prefixes. We also prove sharpness of the square-root displacement dependence.

math.NT

Rational Approximations for Reciprocals of Multiple Zeta Values and Trivariate Cauchy Numbers

In this paper, we will study a trivariate extension of the Cauchy numbers of both the first kind (also called Gregory coefficients) and the second kind (also called N\"orlund numbers) via the Laurent expansion of the reciprocal of any positive integer power (which is called the order) of multiple polylogarithms. In the case of logarithm, we will show by the WZ method that for each order $\ell>1$ some Gregory coefficient of order $\ell$ must vanish, in contrast to the fact that all classical Gregory coefficients are nonzero. We also prove in this higher order logarithm case that the sequence is eventually alternating for each fixed order, a property enjoyed by the classical Gregory coefficients. In the most general setting, we conjecture that these new sequences are all eventually positive, which is supported by strong numerical evidence. Finally, we confirm this conjecture in the special case of polylogarithms and double polylogarithms. As a by product, for each zeta value and double zeta value, we find an infinite family of identities expressing its reciprocal as a sum of a rational number and an improper integral.

math.NT