On factorizing the symbolic \(U\)-resultant. Application of the \(ddet\) operator (Q1260756)

Let \(f_ 1,\dots, f_ k\) be polynomials in \(n\) variables, such that the simultaneous equations \(f_ 1= f_ 2=\dots= f_ k=0\) have a finite number of solutions. \textit{H. Kobayashi}, \textit{T. Fujise} and \textit{A. Furukawa} [J. Symb. Comput. 5, 303-320 (1988; Zbl 0648.12017)] gave a method for finding the solutions and their multiplicities that depends on finding the linear factors of the \(U\)-resultant. In the present paper a method is given that depends on finding the intersections of the hyperplanes corresponding to the linear factors with a randomly chosen line. The method fails in the (rare) cases in which the line is either parallel to a hyperplane or passes through a point common to two hyperplanes. It is explained how the use of an operator \(ddet\) enables the calculations to be simplified by being performed on matrices with a single variable. Some examples, with run times, are given.