Eventually stable quadratic polynomials over \(\mathbb{Q}\) (Q2190809)

From MaRDI portal





scientific article
Language Label Description Also known as
default for all languages
No label defined
    English
    Eventually stable quadratic polynomials over \(\mathbb{Q}\)
    scientific article

      Statements

      Eventually stable quadratic polynomials over \(\mathbb{Q}\) (English)
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      22 June 2020
      0 references
      Let \(K\) be a field, \(\alpha \in K\), \(f \in K[x]\). A pair \((f, \alpha)\) is called {eventually stable over} \(K\) if there exists a constant \(C(f;\alpha)\) such that the number of irreducible factors over \(K\) of \(f^n(x)-\alpha\), where \(f^n\) stands for the \(n\)-th iterate of \(f\), is at most \(C(f;\alpha)\) for all \(n\geq 1\). Also, \(f\) is {eventually stable over} \(K\) if \((f; 0)\) is eventually stable. The authors prove that the polynomial \(f_c(x) = x^2 + 1/c\) is eventually stable over \(\mathbb Q\) for \(c \in {\mathbb Z} \setminus \{0,-1\}\) satisfying \(|c| \leq 10^9\), and that \(C(f_c,0) \leq 4\). They also describe many series of \(c\) when the \(n\)-th iterate of \(f_c\) is irreducible over \(\mathbb Q\) for all \(n \geq 1\).
      0 references
      iterated polynomials
      0 references
      irreducible polynomials
      0 references
      rational points
      0 references
      hyperelliptic curves
      0 references
      arboreal Galois representation
      0 references
      0 references
      0 references
      0 references

      Identifiers