Abstract
We prove that for every positive integer , there exist infinitely many simple abelian varieties over of order . The method is constructive, building on the work of Madan--Pal in the case to produce an explicit sequence of Weil polynomials giving rise to abelian varieties over of order . This sequence itself depends on the choice of a suitable generalized binary representation of ; by making careful choices of this representation, we can ensure that the the resulting sequence of polynomials have 2-adic Newton polygons which guarantee the existence of suitable irreducible factors.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.