2000 character limit reached
A finiteness result for post-critically finite polynomials
Published 17 Oct 2010 in math.NT and math.DS | (1010.3393v2)
Abstract: We show that the set of complex points in the moduli space of polynomials of degree d corresponding to post-critically finite polynomials is a set of algebraic points of bounded height. It follows that for any B, the set of conjugacy classes of post-critically finite polynomials of degree d with coefficients of algebraic degree at most B is a finite and effectively computable set. In the case d=3 and B=1 we perform this computation. The proof of the main result comes down to finding a relation between the "naive" height on the moduli space, and Silverman's critical height.
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.