Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
149 tokens/sec
GPT-4o
9 tokens/sec
Gemini 2.5 Pro Pro
47 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Newly reducible iterates in families of quadratic polynomials (1210.4127v1)

Published 15 Oct 2012 in math.NT

Abstract: We examine the question of when a quadratic polynomial f(x) defined over a number field K can have a newly reducible nth iterate, that is, fn(x) irreducible over K but f{n+1}(x) reducible over K, where fn denotes the nth iterate of f. For each choice of critical point \gamma of f(x), we consider the family g_{\gamma,m}(x)= (x - \gamma)2 + m + \gamma, m \in K. For fixed n \geq 3 and nearly all values of \gamma, we show that there are only finitely many m such that g_{\gamma,m} has a newly reducible nth iterate. For n = 2 we show a similar result for a much more restricted set of \gamma. These results complement those obtained by Danielson and Fein in the higher-degree case. Our method involves translating the problem to one of finding rational points on certain hyperelliptic curves, determining the genus of these curves, and applying Faltings' theorem.

Summary

We haven't generated a summary for this paper yet.