Degree and height estimates for modular equations on PEL Shimura varieties
arXiv:2001.04138 · doi:10.1112/jlms.12540
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.
arXiv commentFinal version to appear in the Journal of the London Mathematical Society
References in corpus (6)
- Computing Hilbert class polynomials with the Chinese Remainder Theorem
- A quasi-linear time algorithm for computing modular polynomials in dimension 2
- An explicit height bound for the classical modular polynomial
- Modular invariants and isogenies
- Computing isogenies from modular equations in genus two
- Upper bounds on the heights of polynomials and rational fractions from their values