Search arXivSearch

arXiv · 2001.03546

On the distribution of orders of Frobenius action on $\ell$-torsion of abelian surfaces

Abstract

The computation of the order of Frobenius action on the $\ell$-torsion is a part of Schoof-Elkies-Atkin algorithm for point counting on an elliptic curve $E$ over a finite field $\mathbb{F}_q$. The idea of Schoof's algorithm is to compute the trace of Frobenius $t$ modulo primes $\ell$ and restore it by the Chinese remainder theorem. Atkin's improvement consists of computing the order $r$ of the Frobenius action on $E[\ell]$ and of restricting the number $t \pmod{\ell}$ to enumerate by using the formula $t^2 \equiv q (ζ+ ζ^{-1})^2 \pmod{\ell}$. Here $ζ$ is a primitive $r$-th root of unity. In this paper, we generalize Atkin's formula to the general case of abelian variety of dimension $g$. Classically, finding of the order $r$ involves expensive computation of modular polynomials. We study the distribution of the Frobenius orders in case of abelian surfaces and $q \equiv 1 \pmod{\ell}$ in order to replace these expensive computations by probabilistic algorithms.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Nikita Kolesnikov, Semyon Novoselov. 2020-01-10. On the distribution of orders of Frobenius action on $\ell$-torsion of abelian surfaces. https://doi.org/10.17223/20710410%2F48%2F3

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