sage

eba04313 - Faster computation of cached Frobenius powers

Faster computation of cached Frobenius powers Calling repeatedly PARI fffrobenius function involves redundant computations that can be avoided by reusing already computed powers.