Search arXivSearch

arXiv · 2609.05371

Short arithmetic terms for the cardinality of elliptic curves over rings of remainder classes and over finite fields

Abstract

Arithmetic terms are fixed finite compositions of addition, truncated subtraction, multiplication, integer division and exponentiation on natural numbers. We construct such terms for the number of affine solutions of $ y^2 = x^3 + Ax + B $. For arbitrary moduli $ n \geq 1 $, a specialization of Prunescu's general construction reduces the number of monomial contributions from fourty-nine to fifteen and the size of the packed integer from approximately $ 2n^{11} $ to approximately $ 2n^5 $ binary digits. For prime moduli $ p \geq 17 $, the Hasse invariant and the trace of Frobenius give a term of about thirty operations. For curves defined over $ \mathbb F_p $, a further term counts the points over $ \mathbb F_{p^k} $ with $ k $ as a variable. For primes $ p \geq 5 $, we also obtain arithmetic terms for the counts over $ \mathbb Z / p^k \mathbb Z $ with $ k $ variable, covering good reduction, nodes and cusps, including non-minimal equations and zero discriminant.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Bogdan Dumitru, Mihai Prunescu. 2026-09-18. Short arithmetic terms for the cardinality of elliptic curves over rings of remainder classes and over finite fields. https://arxiv.org/abs/2609.05371

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