On the number of factors of convolutions of polynomials with integer coefficients (Q1011007)

From MaRDI portal
scientific article
Language Label Description Also known as
English
On the number of factors of convolutions of polynomials with integer coefficients
scientific article

    Statements

    On the number of factors of convolutions of polynomials with integer coefficients (English)
    0 references
    7 April 2009
    0 references
    Let \(f,g,h\) be some polynomials in \(\mathbb{Z}[x]\), \(g\) and \(h\) are relatively prime. The authors prove some conditions on \(f,g,h\) (in terms of their heights, lengths, the leading coefficient of \(g\), etc.) under which the polynomial \(h^{\deg f} f(g/h)\) is irreducible or has not too many irreducible factors. The main condition is that the leading coefficient of \(f\) must be very large in terms of other quantities involved. The main tools in the proofs are some estimates on resultants and a variation of Capelli's theorem which was recently obtained by the first two authors.
    0 references
    0 references
    0 references
    0 references
    0 references
    irreducibility
    0 references
    convolution of polynomials
    0 references
    resultant
    0 references