On a factorization result of Ştefănescu – II

08/06/2023

∙

by   Sanjeev Kumar, et al.

∙

0

∙

share

Ştefănescu proved an elegant factorization result for polynomials over discrete valuation domains [CASC'2014, Lecture Notes in Computer Science, Ed. by V. Gerdt, W. Koepf, W. Mayr, and E. Vorozhtsov, Springer, Berlin, Vol. 8660, pp. 460–471, 2014.] In this paper, a generalization of Ştefănescu's result is proved to cover a larger class of polynomials over discrete valuation domains. Such results are useful in devising algorithms for polynomial factorization.