{"paper":{"title":"Newly reducible iterates in families of quadratic polynomials","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Emma Colbert, Katharine Chamberlin, Patrick Hefferman, Rafe Jones, Sarah Orchard, Sharon Frechette","submitted_at":"2012-10-15T18:01:20Z","abstract_excerpt":"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, f^n(x) irreducible over K but f^{n+1}(x) reducible over K, where f^n denotes the nth iterate of f. For each choice of critical point \\gamma of f(x), we consider the family\ng_{\\gamma,m}(x)= (x - \\gamma)^2 + m + \\gamma, m \\in K.\nFor 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. The"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.4127","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}