On a factorization result of Stefanescu -- II
Abstract
Stefanescu 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 Stefanescu'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.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.