The command SquarefreeFactorization(p, v, rc, R) returns a list of pairs [sqf_i, rc_i].  For each pair, the list sqf_i is a squarefree decomposition of p modulo the saturated ideal of rc_i; each element in the list sqf_i is a pair as [s_j,e_j], where s_j is a squarefree polynomial modulo rc_i and e_j is the exponent of s_j in p.

All the regular chains from the output pairs form a triangular decomposition of rc in the sense of Kalkbrener.

The option 'method' specifies which gcd algorithm to use. The default option, 'method'='evala', uses a modular algorithm. The other option is 'method'='src', which uses a subresultant-based approach. This method is generally slower, but can be faster in some cases, for instance, if the dimension of the saturated ideal of rc is high, say greater than 4.

Assumptions: the polynomial ring is assumed to have characteristic zero; the initial of p is regular w.r.t. rc; v is greater than the main variables of the regular chain rc in R.

The RegularChains[ChainTools][SquarefreeFactorization] command was introduced in Maple 16.

For more information on Maple 16 changes, see Updates in Maple 16.