# How do I compute modular polynomials?

How do I compute modular polynomials in SAGE? More precisely $\phi_{\ell}(X,Y) \pmod{p}$ where $p$ is a prime.

How do I compute modular polynomials?

0

I think this might be what he was looking for:

http://combinat.sagemath.org/doc/refe...

In particular, look at sage.modular.ssmod.ssmod.Phi_polys(L, x, j)

Please use this link instead: http://doc.sagemath.org/html/en/reference/modmisc/sage/modular/ssmod/ssmod.html

Asked: **
2012-01-24 06:56:58 -0500
**

Seen: **708 times**

Last updated: **Aug 10 '16**

How to use modular polynomials in Sage?

pre-reduction multiplication result in binary field

How to compute syzygy module of an ideal in a quotient ring?

inverse of a polynomial modulo another polynomial

calculating the modulo of a "number" in a binary finite field

Trying to display the roots of a polynomial over a finite field

Copyright Sage, 2010. Some rights reserved under creative commons license. Content on this site is licensed under a Creative Commons Attribution Share Alike 3.0 license.

Do you mean things like this? Your question is a little unclear.