factor a multivariate polynomial
field extension over which to factor
multivariate polynomial with rational coefficients
(optional) equation method="Wang"
The factors command computes the factorization of a multivariate polynomial over the rationals, an algebraic number field, and with real or complex numeric coefficients.
Unlike the factor function where the input is any expression and the output is a product of sums in the general case, the input to the factors function must be a polynomial or a rational function, and the output is a data structure more suitable for programming purposes.
The factorization is returned in the form u,f1,m1,...,fn,mn where a=u⁢f1m1...fnmn where each fk (the factor) is a unit normal irreducible polynomial and each mk (its multiplicity) is a positive integer.
For multivariate polynomials with integer coefficients, the factors command offers two algorithms: Wang's algorithm (see [Wang78]) and the algorithm by Monagan and Tuncer ([MT16], [MT18]). The default is the latter, since it is faster on most examples. To explicitly request Wang's algorithm, which was the default in Maple 2018 and earlier versions, use the option method="Wang".
The call factors(a) factors over the field implied by the coefficients present: thus, if all the coefficients are rational, then the polynomial is factored over the rationals.
If the second argument K is the keyword real or complex, a floating-point factorization is performed over R and C respectively. Note, at present this is only implemented for univariate polynomials.
The call factors(a, K) factors the polynomial a over the algebraic number field defined by K. K must be a single RootOf, a list or set of RootOfs, a single radical, or a list or set of radicals.
The following is an example that has a rational function as input.
Mark van Hoeij, Factoring polynomials and the knapsack problem. Journal of Number Theory, 95, 167-189, (2002).
[MT16] Michael Monagan and Baris Tuncer. Using Sparse Interpolation in Hensel Lifting. Proceedings of CASC 2016, Springer-Verlag LNCS 9890, 381-400 (2016).
[MT18] Michael Monagan and Baris Tuncer. Factoring multivariate polynomials with many factors and huge coefficients. Proceedings of CASC 2018, Springer-Verlag LNCS 11077, 319-334 (2018).
[Wang78] Wang, P.S. An improved Multivariate Polynomial Factoring Algorithm, Mathematics of Computation 32, (1978).
The factors command was updated in Maple 2019.
Download Help Document
What kind of issue would you like to report? (Optional)