Search arXivSearch

arXiv · 2503.17944

Relating elliptic curve point-counting and solutions of quadratic forms with congruence conditions

Abstract

In this paper, we analyze the theta series associated to the quadratic form $Q(\mathbf{x}) := x_1^2 + x_2^2 + x_3^2 + x_4^2$ with congruence conditions on $x_i$ modulo $2, 3, 4$, and $6$. By employing special operators on modular, non-holomorphic Eisenstein series of weight $2$, we construct a basis for the Eisenstein space for levels $2^k$ (with $k \le 7$), $3^{\ell}$ (with $\ell \le 3$), and $p$, where $p>3$ is an odd prime. Using the relation between the trace of Frobenius on an elliptic curve and the Fourier coefficients of the cusp-form part of the theta series corresponding to $Q$, we establish a relation between the number of integer solutions to the equation $Q(\mathbf{x}) = p$ and the number of $\mathbb{F}_p$-rational points on the associated elliptic curve under certain congruence conditions on $p$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Koustav Mondal. 2025-10-27. Relating elliptic curve point-counting and solutions of quadratic forms with congruence conditions. https://doi.org/10.1007/s11139-026-01341-5

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