On the irreducibility of the iterates of 𝑥ⁿ-𝑏

DOI10.1090/S0002-9939-01-06258-XzbMath1007.12001OpenAlexW1567904287MaRDI QIDQ2781324

Lynda Danielson, Burton Fein

Publication date: 19 March 2002

Published in: Proceedings of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1090/s0002-9939-01-06258-x

zbMATH Keywords

irreducible\(abc\)-conjecturegeneralized Fermat equationiterated polynomial

Mathematics Subject Classification ID

Polynomials in general fields (irreducibility, etc.) (12E05) Higher degree equations; Fermat's equation (11D41)

Related Items

Settled polynomials over finite fields ⋮ Eventually stable rational functions ⋮ Stability of certain higher degree polynomials ⋮ An iterative construction of irreducible polynomials reducible modulo every prime ⋮ Irreducibility of iterates of post-critically finite quadratic polynomials over \(\mathbb{Q}\) ⋮ Stable polynomials over finite fields ⋮ An infinite family of cubics with emergent reducibility at depth 1 ⋮ Newly reducible polynomial iterates

Cites Work

• Unnamed Item
• Unnamed Item
• On the equation \(x^p+y^q=z^r\): a survey
• Galois group over \(\mathbb{Q}\) of some iterated polynomials
• Realising wreath products of cyclic groups as Galois groups
• Properties of Iterates and Composites of Polynomials
• On the Equations z^m = F (x, y ) and Ax^p + By^q = Cz^r