An elementary proof of Barnett's theorem about the greatest common divisor of several univariate polynomials (Q2564953)

This paper contains a proof of the theorem of S. Barnett on the greatest common divisor of several univariate polynomials [cf. \textit{S. Barnett}, Proc. Camb. Philos. Soc. 70, 263-268 (1971; Zbl 0224.15018)]. The proof avoids the use of invariant factors. The author uses properties of subresultants. He also obtains an extension of the result of Barnett for polynomials with coefficients in an integral domain. He describes an algorithm for the computation of the coefficients of the greatest common divisor. We mention that the complexity of the algorithm is discussed by the author [On the complexity of computing the greatest common divisor of several univariate polynomials, in: Latin '95: Theoretical Informatics, Lect. Notes Comput. Sci. 911, 332--345 (1995; Zbl 07572153)].