Let $a(λ)$ and $b(λ)$ be two polynomials with coefficients in complex numbers and let $f_{\lamb$ be a one-parameter family of polynomials indexed by all complex numbers $λ$. We study whether there exist infinitely many complex numbers $λ$ such that both $a(λ)$ and $b(λ)$ are preperiodic for $f_λ$.
Let $K$ be a number field. Given a polynomial $f(x)\in K[x]$ of degree $d\ge 2$, it is conjectured that the number of preperiodic points of $f$ is bounded by a uniform bound that depends only on $d$ and $[K:\mathbb Q]$. However, the only examples of parametric families of polynomials with no preperiodic points are known when $d$ is divisible by either $2$ or $3$ and $K=\mathbb Q$. In this article, given any integer $d\ge 2$, we display infinitely many parametric families of polynomials of the form $f_t(x)=x^d+c(t)$, $c(t)\in K(t)$, with no rational preperiodic points for any $t\in K$.
In this paper we study two questions related to exceptional behavior of preperiodic points of polynomials in $\mathbb{Q}[x]$. We show that for all $d\geq 2$, there exists a polynomial $f_d(x) \in \mathbb{Q}[x]$ with $2\leq \mathrm{deg}(f_d) \leq d$ such that $f_d(x)$ has at least $d + \lfloor \log_2(d)\rfloor$ rational preperiodic points. Furthermore, we show that for infinitely many integers $d$, the polynomials $f_d(x)$ and $f_d(x) + 1$ have at least $d^2 + d\lfloor \log_2(d)\rfloor - 2d + 1$ common complex preperiodic points.
Given a polynomial $f$ defined over a number field $K$, we make effective certain special cases of a conjecture of S. Ih, on the finiteness of $f$-preperiodic points which are $S$-integral with respect to a fixed non-preperiodic point $α$. As an application, we obtain bounds on the number of $S$-units in the doubly indexed sequence $\{ f^n(α) - f^m(α) \}_{n > m \geq 0}$. In the case of a unicritical polynomial $f_c(z)=z^2+c$, with $α$ fixed to be the critical point 0, for parameters $c$ outside a small region, we give an explicit bound which depends only on the number of places of bad reductio…
Let $d>m>1$ be integers, let $c_1,\dots, c_{m+1}$ be distinct complex numbers, and let $\mathbf{f}(z):=z^d+t_1z^{m-1}+t_2z^{m-2}+\cdots + t_{m-1}z+t_m$ be an $m$-parameter family of polynomials. We prove that the set of $m$-tuples of parameters $(t_1,\dots, t_m)\in\mathbb{C}^m$ with the property that each $c_i$ (for $i=1,\dots, m+1$) is preperiodic under the action of the corresponding polynomial $\mathbf{f}(z)$ is contained in finitely many hypersurfaces of the parameter space $\mathbb{A}^m$.
Fix $d \ge 2$ and a field $k$ such that $\mathrm{char}~k \nmid d$. Assume that $k$ contains the $d$th roots of $1$. Then the irreducible components of the curves over $k$ parameterizing preperiodic points of polynomials of the form $z^d+c$ are geometrically irreducible and have gonality tending to $\infty$. This implies the function field analogue of the strong uniform boundedness conjecture for preperiodic points of $z^d+c$. It also has consequences over number fields: it implies strong uniform boundedness for preperiodic points of bounded eventual period, which in turn reduces the full conje…
Given a number field $K$ and a polynomial $f(z) \in K[z]$ of degree at least 2, one can construct a finite directed graph $G(f,K)$ whose vertices are the $K$-rational preperiodic points for $f$, with an edge $α\to β$ if and only if $f(α) = β$. Restricting to quadratic polynomials, the dynamical uniform boundedness conjecture of Morton and Silverman suggests that for a given number field $K$, there should only be finitely many isomorphism classes of directed graphs that arise in this way. Poonen has given a conjecturally complete classification of all such directed graphs over $\mathbb{Q}$, whi…
Let $f_c(z) = z^2+c$ for $c \in \mathbb{C}$. We show there exists a uniform bound on the number of points in $\mathbb{P}^1(\mathbb{C})$ that can be preperiodic for both $f_{c_1}$ and $f_{c_2}$ with $c_1\not= c_2$ in $\mathbb{C}$. The proof combines arithmetic ingredients with complex-analytic; we estimate an adelic energy pairing when the parameters lie in $\bar{\mathbb{Q}}$, building on the quantitative arithmetic equidistribution theorem of Favre and Rivera-Letelier, and we use distortion theorems in complex analysis to control the size of the intersection of distinct Julia sets. The proof i…
Let $K$ be an algebraically closed field of characteristic zero, and for $c \in K$ and an integer $d \ge 2$, define $f_{d,c}(z) := z^d + c \in K[z]$. We consider the following question: If we fix $x \in K$ and integers $M \ge 0$, $N \ge 1$, and $d \ge 2$, does there exist $c \in K$ such that, under iteration by $f_{d,c}$, the point $x$ enters into an $N$-cycle after precisely $M$ steps? We conclude that the answer is generally affirmative, and we explicitly give all counterexamples. When $d = 2$, this answers a question posed by Ghioca, Nguyen, and Tucker.
In this article, we study the set of parameters $c \in \mathbb{C}$ for which two given complex numbers $a$ and $b$ are simultaneously preperiodic for the quadratic polynomial $f_{c}(z) = z^{2} +c$. Combining complex-analytic and arithmetic arguments, Baker and DeMarco showed that this set of parameters is infinite if and only if $a^{2} = b^{2}$. Recently, Buff answered a question of theirs, proving that the set of parameters $c \in \mathbb{C}$ for which both $0$ and $1$ are preperiodic for $f_{c}$ is equal to $\lbrace -2, -1, 0 \rbrace$. Following his approach, we complete the description of t…
Motivated by the dynamical uniform boundedness conjecture of Morton and Silverman, specifically in the case of quadratic polynomials, we give a formal construction of a certain class of dynamical analogues of classical modular curves. The preperiodic points for a quadratic polynomial map may be endowed with the structure of a directed graph satisfying certain strict conditions; we call such a graph admissible. Given an admissible graph $G$, we construct a curve $X_1(G)$ whose points parametrize quadratic polynomial maps -- which, up to equivalence, form a one-parameter family -- together with …
Let $K$ be an algebraically closed field of characteristic zero, and let $\mathcal{K} := K(t)$ be the rational function field over $K$. For each $d \ge 2$, we consider the unicritical polynomial $f_d(z) := z^d + t \in \mathcal{K}[z]$, and we ask the following question: If we fix $α\in \mathcal{K}$ and integers $M \ge 0$, $N \ge 1$, and $d \ge 2$, does there exist a place $\mathfrak{p} \in \operatorname{Spec} K[t]$ such that, modulo $\mathfrak{p}$, the point $α$ enters into an $N$-cycle after precisely $M$ steps under iteration by $f_d$? We answer this question completely, concluding that the a…
For rational numbers $c$, we present a trichotomy of the set of totally real (totally $p$-adic, respectively) preperiodic points for maps in the quadratic unicritical family $f_c(x)=x^2+c$. As a consequence, we classify quadratic polynomials $f_c$ with rational parameters $c\in\mathbb{Q}$ so that $f_c$ has only finitely many totally real (totally $p$-adic, respectively) preperiodic points. These results rely on an adelic Fekete-type theorem and dynamics of the filled Julia set of $f_c$. Moreover, using a numerical criterion introduced in [NP], we make explicit calculations of the set of totall…
We show that the set of conjugacy classes of cubic polynomials with a prefixed critical point, of preperiod $k\geq 1$, is an irreducible algebraic curve. We also establish an analogous result for quadratic rational maps. We then study a closely related question concerning the irreducibility (over $\mathbb Q$) of the set of conjugacy classes of unicritical polynomials, of degree $D\geq 2$, with a preperiodic critical point. Our proofs are purely algebraic.
Given a number field $K$ and a polynomial $f(z) \in K[z]$, one can naturally construct a finite directed graph $G(f,K)$ whose vertices are the $K$-rational preperiodic points of $f$, with an edge $α\to β$ if and only if $f(α) = β$. The dynamical uniform boundedness conjecture of Morton and Silverman suggests that, for fixed integers $n \ge 1$ and $d \ge 2$, there are only finitely many isomorphism classes of directed graphs $G(f,K)$ as one ranges over all number fields $K$ of degree $n$ and polynomials $f(z) \in K[z]$ of degree $d$. In the case $(n,d) = (1,2)$, Poonen has given a complete clas…
Let $P\in\mathbb{P}_1(\mathbb{Q})$ be a periodic point for a monic polynomial with coefficients in $\mathbb{Z}$. With elementary techniques one sees that the minimal periodicity of $P$ is at most $2$. Recently we proved a generalization of this fact to the set of all rational functions defined over ${\mathbb{Q}}$ with good reduction everywhere (i.e. at any finite place of $\mathbb{Q}$). The set of monic polynomials with coefficients in $\mathbb{Z}$ can be characterized, up to conjugation by elements in PGL$_2({\mathbb{Z}})$, as the set of all rational functions defined over $\mathbb{Q}$ with a…
Mating is an operation that identifies the domains of a polynomial pair in order to obtain a new map on the resulting quotient space. The dynamics of the mating are then dependent on the two polynomials and the manner in which the quotient space was defined, which can be difficult to visualize. This research addresses using Hubbard trees and finite subdivision rules as tools to examine quadratic matings with preperiodic critical points. In many cases, discrete parameter information on such quadratic pairs can be translated into topological information on the dynamics of their mating. The centr…
Among all the dynamical modular curves associated to quadratic polynomial maps, we determine which curves have infinitely many quadratic points. This yields a classification statement on preperiodic points for quadratic polynomials over quadratic fields, extending previous work of Poonen, Faber, and the authors.
We prove that if $f$ is a polynomial over a number field $K$ with a finite superattracting periodic point and a non-archimedean place of bad reduction, then there is an $ε>0$ such that only finitely many $P\in K^{\text{ab}}$ have canonical height less than $ε$ with respect to $f$. The key ingredient is the geometry of the filled Julia set at a place of bad reduction. We also prove a conditional uniform boundedness result for the $K$-rational preperiodic points of such polynomials, as well as a uniform lower bound on the canonical height of non-preperiodic points in $K$. We further prove uncond…
According to the Thurston No Wandering Triangle Theorem, a branching point in a locally connected quadratic Julia set is either preperiodic or precritical. Blokh and Oversteegen proved that this theorem does not hold for higher degree Julia sets: there exist cubic polynomials whose Julia set is a locally connected dendrite with a branching point which is neither preperiodic nor precritical. In this article, we reprove this result, constructing such cubic polynomials as limits of cubic polynomials for which one critical point eventually maps to the other critical point which eventually maps to …
A topological mating is a map defined by gluing together the filled Julia sets of two quadratic polynomials. The identifications are visualized and understood by pinching ray-equivalence classes of the formal mating. For postcritically finite polynomials in non-conjugate limbs of the Mandelbrot set, classical results construct the geometric mating from the formal mating. Here families of examples are discussed, such that all ray-equivalence classes are uniformly bounded trees. Thus the topological mating is obtained directly in geometrically finite and infinite cases. On the other hand, renorm…
In this paper, we study multiplicative dependence of values of polynomials or rational functions over a number field. As an application, we obtain new results on multiplicative dependence in the orbits of a univariate polynomial dynamical system. We also obtain a broad generalisation of the Northcott theorem replacing the finiteness of preperiodic points from a given number field by the finiteness of initial points with two multiplicatively dependent elements in their orbits.
We classify all post-critically finite unicritical polynomials defined over the maximal totally real algebraic extension of ${\mathbb Q}$. Two auxiliary results used in the proof of this result may be of some independent interest. The first is a recursion formula for the $n$-diameter of an interval, which uses properties of Jacobi polynomials. The second is a numerical criterion which allows one to the give a bound on the degree of any algebraic integer having all of its complex embeddings in a real interval of length less than $4$.
