Factoring polynomials in the ring of formal power series over Z
classification
🧮 math.AC
math.NT
keywords
polynomialspowerseriesfactorizationformalringalgorithmarbitrary
read the original abstract
We consider polynomials with integer coefficients and discuss their factorization properties in Z[[x]], the ring of formal power series over Z. We treat polynomials of arbitrary degree and give sufficient conditions for their reducibility as power series. Moreover, if a polynomial is reducible over Z[[x]], we provide an explicit factorization algorithm. For polynomials whose constant term is a prime power, our study leads to the discussion of p-adic integers.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.