A unified method for multivariate polynomial factorizations (Q689904)

It is desired to factorize the polynomial \(F(x,y,\dots,z)\). First \(f(0,0,\dots, 0)\) is factorized and then the generalized Hensel construction leads to \(F=\prod_{i=1}^ m G_ i(x,y,\dots, z)\) modulo \((y,\dots,z)^{k+1}\) for a sufficiently large integer \(k\). The final stage is to solve a linear system on the numerical coefficients derived from the \(G_ i\), and it is at this stage that this method differs from that of \textit{P. Wang} and \textit{L. Rothschild} [Math. Comput. 29, 935-950 (1975; Zbl 0311.10052)]. The method is applicable over various coefficient domains.