Modules over orders, conjugacy classes of integral matrices, and abelian varieties over finite fields
arXiv:2208.05409 · doi:10.1007/s40993-024-00584-9
Abstract
We give an algorithm to compute representatives of the conjugacy classes of semisimple square integral matrices with given minimal and characteristic polynomials. We also give an algorithm to compute the -isomorphism classes of abelian varieties over a finite field which belong to an isogeny class determined by a characteristic polynomial of Frobenius when is ordinary, or is prime and has no real roots.
arXiv commentversion accepted in ANTS XVI proceedings
References in corpus (7)
- Nemo/Hecke: Computer Algebra and Number Theory Packages for the Julia Programming Language
- Computing the ideal class monoid of an order
- Computing square-free polarized abelian varieties over finite fields
- Almost ordinary abelian varieties over finite fields
- Lattices over Bass rings and graph agglomerations
- Polarizations of abelian varieties over finite fields via canonical liftings
- Computing abelian varieties over finite fields isogenous to a power