Irreducibility results for compositions of polynomials with integer coefficients (Q867144)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 5126992
Language Label Description Also known as
default for all languages
No label defined
    English
    Irreducibility results for compositions of polynomials with integer coefficients
    scientific article; zbMATH DE number 5126992

      Statements

      Irreducibility results for compositions of polynomials with integer coefficients (English)
      0 references
      15 February 2007
      0 references
      The paper begins by a very interesting survey of results on irreducibility of composite polynomials. In this work, the authors obtain explicit upper bounds for the number of irreducible factors for a class of polynomials of the form \(f \circ g\), where \(f\) and \(g\) are polynomials with integer coefficients, in terms of the degrees of \(f\) and \(g\), and the size of the coefficients of \(f\). In particular, some irreducibility results are given for this class of composite polynomials. The methods of proofs are essentially elementary.
      0 references
      composition of polynomials
      0 references
      irreducibility of polynomials
      0 references

      Identifiers