PolynomialTools[GreatestFactorialFactorization] - compute a greatest factorial factorization of a univariate polynomial
|
Calling Sequence
|
|
GreatestFactorialFactorization(f,x)
|
|
Parameters
|
|
f
|
-
|
polynomial in x
|
x
|
-
|
indeterminate
|
|
|
|
|
Description
|
|
•
|
The GreatestFactorialFactorization command computes a greatest factorial factorization of f w.r.t. x. It satisfies the following properties.
|
|
for
|
•
|
The greatest factorial factorization is unique up to multiplication by units.
|
•
|
GreatestFactorialFactorization can handle the same types of coefficients as the Maple function gcd.
|
•
|
If f is constant w.r.t. x, then the return value is .
|
•
|
Partial factorizations of the input are not taken into account.
|
|
|
References
|
|
|
Paule, Peter. "Greatest factorial factorization and symbolic summation." Journal of Symbolic Computation Vol. 20, (1995): 235-268.
|
|
Gerhard, Juergen. "Modular algorithms for polynomial basis conversion and greatest factorial factorization." Proceedings of the Seventh Rhine Workshop on Computer Algebra, RWCA pp. 125-141 ed. T. Mulders, 2000.
|
|
|
Download Help Document
Was this information helpful?