ModularFactorizationGeneral(PA, MMT, MD, PMD, MO)

ffact.spad line 392 [edit on github]

• PA: Type

• MMT: Type

• MD: Type

• PMD: Type

• MO: ModularFactorizationOperations(PA, MMT, MD, PMD)

This package implements factorization of polynomials over finite fields using a variant of Kaltofen-Shoup method. Nontrivial data have abstract representation, operations are provided by matching package.

ddfact: (PA, MD) -> List Record(poly: PA, degree: NonNegativeInteger, separate_factors: () -> List PA)

ddfact(pv, md) computes distint degree factorization of pv. pv is assumed square-free and monic, md is info representing finite field.

irreducible?: (PA, MD) -> Boolean

irreducible?(pv, md) checks if pv is irreducible. pv is assumed square-free and monic, md is info representing finite field.

mfactor: (PA, MD) -> List PA

mfactor(pv, md) computes factorization of pv into irreducibles over field described by md. pv is assumed square-free and monic, md is info representing finite field.