Papers › Decomposing abelian varieties into simple factors: algorithms and applications
Decomposing abelian varieties into simple factors: algorithms and applications
Rubí E. Rodríguez, Anita M. Rojas
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
We give an effective procedure to explicitly find the decomposition of a polarized abelian variety into its simple factors if a period matrix is known. Since finding this datum is not easy, we also provide two methods to compute the period matrix for a polarized abelian variety, depending on the given geometric information about it. These results work particularly well in combination with our previous work on abelian varieties with group actions, since they allow us to fully decompose such varieties by successively decomposing their factor subvarieties, even when these no longer have a group action. We highlight that we do not require to determine the full endomorphism algebra of any of the (sub)varieties involved. We illustrate the power of our algorithms with two byproducts: we find a completely decomposable Jacobian variety of dimension 101, filling this Ekedahl-Serre gap, and we describe a new completely decomposable Jacobian variety of CM type of dimension 11.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections