# PolynomialSquareFree(VarSet, E, RC, P)¶

This package computes square-free decomposition of multivariate polynomials over a coefficient ring which is an arbitrary gcd domain. The requirement on the coefficient domain guarantees that the content can be removed so that factors will be primitive as well as square-free. Over an infinite ring of finite characteristic, it may not be possible to guarantee that the factors are square-free.

squareFree: P -> Factored P

squareFree(p) returns the square-free factorization of the polynomial p. Each factor has no repeated roots, and the factors are pairwise relatively prime.