2000 character limit reached
Equivalent computational problems for superspecial abelian surfaces
Published 26 Jan 2026 in math.AG, cs.CR, and math.NT | (2601.18050v1)
Abstract: We show reductions and equivalences between various problems related to the computation of the endomorphism ring of principally polarised superspecial abelian surfaces. Problems considered are the computation of the Ibukiyama-Katsura-Oort matrix and computation of unpolarised isomoprhisms between superspecial abelian surfaces.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.
