Common preperiodic points for quadratic polynomials
Laura DeMarco, Holly Krieger, Hexi Ye

TL;DR
This paper establishes a uniform bound on the number of common preperiodic points for different quadratic polynomials, combining arithmetic and complex analysis techniques to achieve effective results with explicit constants.
Contribution
It introduces a novel uniform bound on shared preperiodic points for quadratic polynomials with different parameters, integrating arithmetic and complex-analytic methods.
Findings
Existence of a uniform bound on common preperiodic points
Effective bounds with explicit constants provided
Application of adelic energy pairing and distortion theorems
Abstract
Let for . We show there exists a uniform bound on the number of points in that can be preperiodic for both and with in . The proof combines arithmetic ingredients with complex-analytic; we estimate an adelic energy pairing when the parameters lie in , 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 is effective, and we provide explicit constants for each of the results.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMathematical Dynamics and Fractals · Meromorphic and Entire Functions · Analytic Number Theory Research
