Resumen de Irreducibility Results for Compositions of Polynomials with Integer Coefficients

Anca Iuliana Bonciocat, Alexandru Zaharescu

• We obtain explicit upper bounds for the number of irreducible factors for a class of polynomials of the form f???g, where f,g are polynomials with integer coefficients, in terms of the prime factorization of the leading coefficients of f and g, the degrees of f and g, and the size of coefficients of f. In particular, some irreducibility results are given for this class of compositions of polynomials.