Irreducibility criteria for compositions of polynomials with integer coefficients

DOI10.1007/s00605-016-0890-4zbMath1360.11109OpenAlexW3146625425MaRDI QIDQ515627

Maurice Mignotte, Mihai Cipu, Nicolae Ciprian Bonciocat, Yann Bugeaud

Publication date: 16 March 2017

Published in: Monatshefte für Mathematik (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00605-016-0890-4

zbMATH Keywords

prime numbersirreducible polynomialscompositions of polynomials

Mathematics Subject Classification ID

Polynomials in general fields (irreducibility, etc.) (12E05) Polynomials (irreducibility, etc.) (11R09)

Related Items (1)

Apollonius circles and irreducibility criteria for polynomials

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Irreducibility criteria of Schur-type and Pólya-type
• Irreducibility results for compositions of polynomials with integer coefficients
• On the number of factors of convolutions of polynomials with integer coefficients
• Über die Irreduzibilität einer Klasse von ganzen rationalen Funktionen
• On a special case of Hilbert's irreducibility theorem
• On the irreducibility of a class of polynomials. III
• IRREDUCIBILITY CRITERIA FOR SUMS OF TWO RELATIVELY PRIME POLYNOMIALS
• On the irreducibility of a class of polynomials, IV
• On the irreducibility of neighbouring polynomials
• Upper bounds for the number of factors for a class of polynomials with rational coefficients

This page was built for publication: Irreducibility criteria for compositions of polynomials with integer coefficients