Abstract

We define modular equations in the setting of PEL Shimura varieties as equations describing Hecke correspondences, and prove upper bounds on their degrees and heights. This extends known results about elliptic modular polynomials, and implies complexity bounds for number-theoretic algorithms using these modular equations. In particular, we obtain tight degree bounds for modular equations of Siegel and Hilbert type for abelian surfaces.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call