Computing square-free polarized abelian varieties over finite fields
Publication date
2021-03
Editors
Advisors
Supervisors
Document Type
Article
Metadata
Show full item recordCollections
License
Abstract
We give algorithms to compute isomorphism classes of ordinary abelian varieties defined over a finite field Fq whose characteristic polynomial (of Frobenius) is square-free and of abelian varieties defined over the prime field Fp whose characteristic polynomial is square-free and does not have real roots. In the ordinary case we are also able to compute the polarizations and the group of automorphisms (of the polarized variety) and, when the polarization is principal, the period matrix.
Keywords
math.AG, math.NT, 14K15 (Primary) 14G15, 11G10, 11G25, 14-04 (Secondary), Computational Mathematics, Applied Mathematics, Algebra and Number Theory
Citation
Marseglia, S 2021, 'Computing square-free polarized abelian varieties over finite fields', Mathematics of Computation, vol. 90, no. 328, pp. 953-971. https://doi.org/10.1090/mcom/3594