The size of arboreal images, I: exponential lower bounds for PCF and unicritical polynomials
Carlo Pagano

TL;DR
This paper establishes exponential lower bounds for the degrees of arboreal fields associated with certain polynomials, advancing understanding of their growth in both post-critically finite and infinite cases, using new methods under various assumptions.
Contribution
It introduces two methods to derive exponential lower bounds for arboreal degrees, one conditional on GRH for PCF polynomials and one unconditional for unicritical post-critically infinite polynomials.
Findings
For PCF polynomials, degrees grow exponentially assuming GRH.
Unconditional exponential lower bounds are proved for unicritical post-critically infinite polynomials.
The methods exploit the finiteness of critical orbits and prime-based constructions.
Abstract
Let be a polynomial over a global field . For each in and in denote by the arboreal field and by its degree over . It is conjectured that should grow as a double exponential function of , unless is post-critically finite (PCF), in which case there are examples like . There is evidence conditionally on Vojta's conjecture. However, before the present work, no unconditional non-trivial lower bound was known for post-critically infinite . In the case is PCF, no non-trivial lower bound was known, not even under Vojta's conjecture. In this paper we give two simple methods that turn the finiteness of the critical orbit into an exploitable feature, also in the post-critically infinite case. First, assuming GRH for number fields, we…
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
TopicsAlgebraic Geometry and Number Theory · Coding theory and cryptography · Advanced Differential Equations and Dynamical Systems
