Search arXivSearch

arXiv · 1906.02264

Estimates for the number of rational points on simple abelian varieties over finite fields

Abstract

Let $A$ be a simple abelian variety of dimension $g$ over the field $\mathbb{F}_q$. The paper provides improvements on the Weil estimates for the size of $A(\mathbb{F}_q)$. For an arbitrary value of $q$ we prove $(\lfloor(\sqrt{q}-1)^2 \rfloor + 1)^g \leqslant A(\mathbb{F}_q) \leqslant (\lceil(\sqrt{q}+1)^2 \rceil - 1)^{g}$ holds with finitely many exceptions. We compute improved bounds for various small values of $q$. For instance, the Weil bounds for $q=3,4$ give a trivial estimate $A(\mathbb{F}_q) \geqslant 1$; we prove $A(\mathbb{F}_3) \geqslant 1.359^g$ and $A(\mathbb{F}_4) \geqslant 2.275^g$ hold with finitely many exceptions. We use these results to describe all abelian varieties over finite fields that have no new points in some finite field extension.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Borys Kadets. 2021-06-26. Estimates for the number of rational points on simple abelian varieties over finite fields. https://arxiv.org/abs/1906.02264

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