Search arXivSearch

arXiv · 1806.10789

The characteristic polynomials of abelian varieties of higher dimension over finite fields

Abstract

The characteristic polynomials of abelian varieties over the finite field $\mathbb{F}_q$ with $q=p^n$ elements have a lot of arithmetic and geometric information. They have been explicitly described for abelian varieties up to dimension 4, but little is known in higher dimension. In this paper, among other things, we obtain the following three results on the characteristic polynomial of abelian varieties. First, we prove a relation between $n$ and $e$, where $e$ is a certain multiplicity associated with a simple abelian variety of arbitrary dimension over $\mathbb{F}_q$. Second, we explicitly describe the characteristic polynomials of simple abelian varieties of arbitrary dimension $g$, when $e=g$. Finally, we explicitly describe the coefficients of characteristic polynomials of abelian varieties of dimension 5 over $\mathbb{F}_q$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Daiki Hayashida. 2021-09-01. The characteristic polynomials of abelian varieties of higher dimension over finite fields. https://doi.org/10.1016/j.jnt.2018.09.014

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