Modules over orders, conjugacy classes of integral matrices, and abelian varieties over finite fields
Stefano Marseglia

TL;DR
This paper presents algorithms for classifying conjugacy classes of semisimple integral matrices and for enumerating isomorphism classes of certain abelian varieties over finite fields, advancing computational methods in algebraic number theory and algebraic geometry.
Contribution
It introduces new algorithms for computing conjugacy class representatives of semisimple matrices and for classifying abelian varieties over finite fields based on their Frobenius characteristic polynomial.
Findings
Algorithm for conjugacy class representatives of integral matrices.
Algorithm for classifying abelian varieties over finite fields.
Effective enumeration of isomorphism classes in specified cases.
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCoding theory and cryptography · Finite Group Theory Research · Advanced Algebra and Geometry
