On a factorization result of \c{S}tef\u{a}nescu -- II
Number Theory
2023-09-18 v2 Numerical Analysis
Commutative Algebra
Numerical Analysis
Abstract
\c{S}tef\u{a}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. \textbf{8660}}, pp. 460--471, 2014.] In this paper, a generalization of \c{S}tef\u{a}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.
Keywords
Cite
@article{arxiv.2308.03046,
title = {On a factorization result of \c{S}tef\u{a}nescu -- II},
author = {Sanjeev Kumar and Jitender Singh},
journal= {arXiv preprint arXiv:2308.03046},
year = {2023}
}
Comments
pp5