Factorization theorems with sharp bounds and an extension of the Dumas irreducibility criterion to formal power series over PIDs and DVRs using Newton polygons and constant term factorizations.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
math.NT 2verdicts
UNVERDICTED 2representative citing papers
Upper bounds on the number of irreducible factors of certain integer polynomials are obtained from prime factorizations of evaluated values and complex root locations, extending to bivariate polynomials via non-Archimedean valuations.
citing papers explorer
-
Some factorization results for formal power series
Factorization theorems with sharp bounds and an extension of the Dumas irreducibility criterion to formal power series over PIDs and DVRs using Newton polygons and constant term factorizations.
-
Prime numbers and factorization of polynomials
Upper bounds on the number of irreducible factors of certain integer polynomials are obtained from prime factorizations of evaluated values and complex root locations, extending to bivariate polynomials via non-Archimedean valuations.