English

Preperiodic points for quadratic polynomials with small cycles over quadratic fields

Number Theory 2021-08-12 v2 Dynamical Systems

Abstract

Given a number field KK and a polynomial f(z)K[z]f(z) \in K[z], one can naturally construct a finite directed graph G(f,K)G(f,K) whose vertices are the KK-rational preperiodic points of ff, with an edge αβ\alpha \to \beta if and only if f(α)=βf(\alpha) = \beta. The dynamical uniform boundedness conjecture of Morton and Silverman suggests that, for fixed integers n1n \ge 1 and d2d \ge 2, there are only finitely many isomorphism classes of directed graphs G(f,K)G(f,K) as one ranges over all number fields KK of degree nn and polynomials f(z)K[z]f(z) \in K[z] of degree dd. In the case (n,d)=(1,2)(n,d) = (1,2), Poonen has given a complete classification of all directed graphs which may be realized as G(f,Q)G(f,\mathbb{Q}) for some quadratic polynomial f(z)Q[z]f(z) \in \mathbb{Q}[z], under the assumption that ff does not admit rational points of large period. The purpose of the present article is to continue the work begun by the author, Faber, and Krumm on the case (n,d)=(2,2)(n,d) = (2,2). By combining the results of the previous article with a number of new results, we arrive at a partial result toward a theorem like Poonen's -- with a similar assumption on points of large period -- but over all quadratic extensions of Q\mathbb{Q}.

Keywords

Cite

@article{arxiv.1509.07098,
  title  = {Preperiodic points for quadratic polynomials with small cycles over quadratic fields},
  author = {John R. Doyle},
  journal= {arXiv preprint arXiv:1509.07098},
  year   = {2021}
}

Comments

Fixed some minor errors; redefined admissibility; references updated. An ancillary .txt file with the input/output for the necessary computations in Magma has been added

R2 v1 2026-06-22T11:03:55.032Z