2000 character limit reached
Bounded height in families of dynamical systems
Published 15 Mar 2017 in math.NT, math.AG, and math.DS | (1703.05365v1)
Abstract: Let a and b be algebraic numbers such that exactly one of a and b is an algebraic integer, and let f_t(z):=z2+t be a family of polynomials parametrized by t. We prove that the set of all algebraic numbers t for which there exist positive integers m and n such that f_tm(a)=f_tn(b) has bounded Weil height. This is a special case of a more general result supporting a new bounded height conjecture in dynamics. Our results fit into the general setting of the principle of unlikely intersections in arithmetic dynamics.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.