On the irreducibility of the iterates of \(x^{n}-b\) (Q2781324)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On the irreducibility of the iterates of \(x^{n}-b\) |
scientific article; zbMATH DE number 1721068
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the irreducibility of the iterates of \(x^{n}-b\) |
scientific article; zbMATH DE number 1721068 |
Statements
19 March 2002
0 references
iterated polynomial
0 references
irreducible
0 references
generalized Fermat equation
0 references
\(abc\)-conjecture
0 references
On the irreducibility of the iterates of \(x^{n}-b\) (English)
0 references
Suppose that \(f(x) = x^n - b\) is a polynomial irreducible over a field \(K\). The authors investigate under what circumstances all iterates of \(f(x)\) are irreducible over \(K\). This happens, for example, when \(K = {\mathbb Q}\), \(b \in {\mathbb Z}\), when \(K = {\mathbb Q}(t)\) (rational function field) and \(b \in {\mathbb Z}[t]\) (polynomial ring), when \(K = F(t)\) and \(b \in F[t]\), for \(F\) an algebraically closed field, and when \(K = F(t)\), \(b\) in \(F(t)\) but not \(F\), \(n \geq 3\) and \(F\) a field of characteristic 0. The existence of a reducible iterate is tied to the existence of a primitive solution to a Diophantine equation of the form \(x^p + y^p = z^r\) for a suitable prime \(p\).
0 references