Irreducibility results for compositions of polynomials with integer coefficients
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.
- Irreducibility criteria for compositions of polynomials with integer coefficients
- Irreducibility criteria for some classes of compositions of polynomials with integer coefficients
- Irreducibility results for compositions of polynomials in several variables
- scientific article; zbMATH DE number 6476583
- scientific article; zbMATH DE number 5693568
- On the irreducibility of some composite polynomials
- Irreducible polynomials with reducible compositions
- Irreducibility of integer-valued polynomials in several variables
- An irreducibility criterion for polynomials with integer coefficients
- A useful irreducibility result for integer polynomials
- Criteria for the irreducibility of polynomials
- scientific article; zbMATH DE number 3260031 (Why is no real title available?)
- scientific article; zbMATH DE number 3396043 (Why is no real title available?)
- Irreducibility of polynomials
- Lösung und Verallgemeinerung eines Schurschen Irreduzibilitätsproblems für Polynome
- On a special case of Hilbert's irreducibility theorem
- On Hilbert's irreducibility theorem
- On the irreducibility of a class of polynomials. III
- Upper bounds for the number of factors for a class of polynomials with rational coefficients
- Über die Irreduzibilität von Polynomen
- Über Irreduzibilitätskriterien von I. Schur und G. Polya
- On the number of factors of convolutions of polynomials with integer coefficients
- An irreducibility criterion for the sum of two relatively prime polynomials
- Some irreducibility and indecomposability results for truncated binomial polynomials of small degree
- Irreducibility criteria for the sum of two relatively prime multivariate polynomials
- Irreducibility results for compositions of polynomials in several variables
- Irreducibility of integer-valued polynomials in several variables
- Irreducibility criteria for sums of two relatively prime polynomials
- scientific article; zbMATH DE number 6476583 (Why is no real title available?)
- scientific article; zbMATH DE number 5371107 (Why is no real title available?)
- scientific article; zbMATH DE number 5693568 (Why is no real title available?)
- On the irreducibility of certain polynomials with coefficients as products of terms in an arithmetic progression
- Irreducibility criteria for compositions of polynomials with integer coefficients
- Irreducibility criteria for some classes of compositions of polynomials with integer coefficients
This page was built for publication: Irreducibility results for compositions of polynomials with integer coefficients
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q867144)
