Abstract
We provide upper bounds on the total number of irreducible factors, and in particular irreducibility criteria for some classes of bivariate polynomials f(x, y) over an arbitrary field K . Our results rely on information on the degrees of the coefficients of f, and on information on the factorization of the constant term and of the leading coefficient of f, viewed as a polynomial in y with coefficients in K [ x ] . In particular, we provide a generalization of the bivariate version of Perron’s irreducibility criterion, and similar results for polynomials in an arbitrary number of indeterminates. The proofs use non-Archimedean absolute values, that are suitable for finding information on the location of the roots of f in an algebraic closure of K ( x ) .
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
