TwoFactorize FΒΆ
twofact.spad line 53 [edit on github]
A basic package for the factorization of bivariate polynomials over a finite field. The functions here represent the base step for the multivariate factorizer.
- doFactor: (SparseUnivariatePolynomial SparseUnivariatePolynomial F, Integer, Boolean) -> Factored SparseUnivariatePolynomial SparseUnivariatePolynomial F
doFactor(p, n, ext?)
returns the factorisation of polynomialp
,p
is assumed to be primitive and squarefree,n
is degree in auxilary variable, ext? iffalse
inhibits use of extension field.
- generalSqFr: SparseUnivariatePolynomial SparseUnivariatePolynomial F -> Factored SparseUnivariatePolynomial SparseUnivariatePolynomial F
generalSqFr(p)
returns the square-free factorisation of polynomialp
, a sparse univariate polynomial (sup) over a sup overF
.
- generalTwoFactor: SparseUnivariatePolynomial SparseUnivariatePolynomial F -> Factored SparseUnivariatePolynomial SparseUnivariatePolynomial F
generalTwoFactor(p)
returns the factorisation of polynomialp
, a sparse univariate polynomial (sup) over a sup overF
.
- tryTwoFactor: SparseUnivariatePolynomial SparseUnivariatePolynomial F -> Factored SparseUnivariatePolynomial SparseUnivariatePolynomial F
tryTwoFactor(p)
returns the factorisation of polynomialp
, if it does not require using field extensions, otherwise returnsp
unfactored (nil factorization).
- twoFactor: (SparseUnivariatePolynomial SparseUnivariatePolynomial F, Integer) -> Factored SparseUnivariatePolynomial SparseUnivariatePolynomial F
twoFactor(p, n)
returns the factorisation of polynomialp
, a sparse univariate polynomial (sup) over a sup overF
. Also,p
is assumed primitive and square-free andn
is the degree of the inner variable ofp
(maximum of the degrees of the coefficients ofp
).