Hostname: page-component-74656f9884-2dmjx Total loading time: 0 Render date: 2026-11-06T16:02:00.338Z Has data issue: false hasContentIssue false

Shared dynamically small points for polynomials on average

Published online by Cambridge University Press:  01 September 2025

YAN SHENG ANG
Affiliation:
Department of Mathematics, Massachusetts Institute of Technology , Cambridge, MA 02139, USA (e-mail: angyansheng@yahoo.com.sg)
JIT WU YAP*
Affiliation:
Department of Mathematics, Harvard University , Cambridge, MA 02138, USA
Rights & Permissions [Opens in a new window]

Abstract

Given two rational maps $f,g: \mathbb {P}^1 \to \mathbb {P}^1$ of degree d over $\mathbb {C}$, DeMarco, Krieger, and Ye [Common preperiodic points for quadratic polynomials. J. Mod. Dyn. 18 (2022), 363–413] have conjectured that there should be a uniform bound $B = B(d)> 0$ such that either they have at most B common preperiodic points or they have the same set of preperiodic points. We study their conjecture from a statistical perspective and prove that the average number of shared preperiodic points is zero for monic polynomials of degree $d \geq 6$ with rational coefficients. We also investigate the quantity $\liminf _{x \in \overline {\mathbb {Q}}} (\widehat {h}_f(x) + \widehat {h}_g(x) )$ for a generic pair of polynomials and prove both lower and upper bounds for it.

Information

Type
Original Article
Copyright
© The Author(s), 2025. Published by Cambridge University Press
Figure 0

Figure 1 Newton polygon for $f-c$ for $c\in K_{f,v}\cap{\mathbb C}_v$, when $\lvert c\rvert_v=r_1$ (below), or $\lvert c\rvert_v=r_2$ or $r_3$ (above).