Abelian varieties over F2 of prescribed order
Abstract
We prove that for every positive integer m, there exist infinitely many simple abelian varieties over F2 of order m. The method is constructive, building on the work of Madan--Pal in the case m=1 to produce an explicit sequence of Weil polynomials giving rise to abelian varieties over F2 of order m. This sequence itself depends on the choice of a suitable generalized binary representation of m; 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.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.