{"id":"f2f605cb-2a4e-4254-adb6-928e1e35a538","arxiv_id":"1908.09111","paper_version":1,"verdict":"REJECT","confidence":"MODERATE","novelty_score":6.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":0,"one_line_summary":"Every parameter ray at a critical portrait of a degree-d (d≥2) non-recurrent polynomial lands at that polynomial.","lead":"A mathematical proof shows that, for a broad class of polynomials called non-recurrent, the parameter-space rays that encode the location of critical points always land on the polynomial that produces them. The result extends an earlier theorem from Misiurewicz polynomials to a much larger family, based on new distortion estimates.","discovery_kind":"extension","skeptic_critique":{"model":"deepseek-v4-flash","headline":"Theorem 1.1's distortion estimate (4.5) depends on Theorem 3.4, whose hypotheses (A1)-(A4) are never verified for the application; X0=Crit(f) can violate (A4), and Remark 3.1's unproved generalization is essential.","rationale":"The reader's weakest assumption pinpoints the exact load-bearing issue: the distortion theorem controlling the Thurston pullback is proved under restrictive hypotheses, and the application does not verify them. I agree. The natural X0=Crit(f) violates (A4) for non-recurrent polynomials whose critical orbits merge after more than one iterate. The manuscript's Remark 3.1 acknowledges that (A2)-(A4) are not essential and states a more general theorem, but provides no proof; citing an unproved claim does not constitute a proof. Step III's estimate (4.5) is thus not established for all f covered by Theorem 1.1. That said, the gap appears repairable: one can define X0 as the finite union of critical orbit segments between successive intersections with the critical set, which satisfies (A1)-(A4) for non-recurrent f (no critical orbit can contain a recurrent point without the critical point being recurrent, and critical orbit intersection graphs are acyclic without superattracting cycles). The authors' absent verification of such an X0 is a genuine omission, not a trivial typo. Therefore the submitted proof is incomplete, matching the reader's REJECT, though the underlying theorem is likely true and a conditionally revised version could be acceptable.","tokens_in":114,"tokens_out":20403,"duration_ms":414140,"concrete_test":"Verify whether the finite set X0' := Crit(f) union {f^k(c) : c in Crit(f), 0<k<min{j>0 : f^j(c) in Crit(f)}} satisfies (A1)-(A4) for every non-recurrent polynomial f. If yes, the gap is a missing specification and the proof can be repaired by re-running Theorem 3.4 with X0' instead of Crit(f); if a non-recurrent f is found for which no such finite X0 exists, the proof's reliance on Theorem 3.4 is fundamentally flawed.","verdict_should_be":"UNCHANGED","load_bearing_attack":"Section 3.4 (Theorem 3.4) gives the estimate (4.5) that forces eta_{r,n} toward id in Step III. The theorem is proved only for a finite X0 satisfying (A1)-(A4). In the proof of Theorem 1.1, X0 is not named, but the omitted disks are W_{r,c}, the components of f^{-1}(W_{r,v}) around critical points, so the intended X0 is Crit(f). For a non-recurrent polynomial with a critical orbit relation f^n(c1)=c2 for n>=2, (A4) requires f(c1),...,f^{n-1}(c1) in X0, which fails because those intermediate points are not critical points. Such polynomials exist, e.g., post-critically finite Misiurewicz maps with merging critical orbits. Remark 3.1 acknowledges this and asserts that only (A1) is essential, stating a more general theorem, but gives no proof. Since the paper invokes Theorem 3.4 as stated, not the asserted generalization, the key estimate (4.5) is unsupported for these cases. The gap is repairable by choosing a larger finite X0 containing all critical orbit segments up to critical hits, but that verification is absent from the manuscript.","agreement_with_reader":"agree"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper claims to prove that for any non-recurrent polynomial f of degree d ≥ 2 and any critical portrait Θ of f, the parameter ray RC_d(Θ) lands at f, thereby generalizing a result of Kiwi. The proof strategy combines a surgery construction of topological polynomials F_r (Step I), a c-equivalence to the polynomial f_r on the parameter ray (Step II), a Thurston iteration controlled by a new distortion theorem (Theorem 3.4), and a convergence argument using the crucial estimate (4.5) to show that the polynomial limits coincide with f. The overall structure is coherent and the paper is clearly organized.","tokens_in":18005,"tokens_out":12601,"duration_ms":124806,"significance":"If the proof is completed, the result would be a substantial generalization of Kiwi's ray-landing theorem and would further demonstrate the applicability of the Cui–Tan distortion theory to non-recurrent dynamics. The paper's main strategy is attractive and the exposition is detailed. The central technical tool, Theorem 3.4, is a genuine extension of earlier distortion results. However, the theorem is proven under restrictive hypotheses (A1)–(A4), and the application to Theorem 1.1 requires a more general version that is only asserted, not proved, in Remark 3.1. This gap is load-bearing because the estimate (4.5) is the key input that forces the Thurston iterates to converge to the identity. The paper does not include machine-checked proofs or reproducible code; the verification is traditional.","major_comments":[{"comment":"Theorem 3.4, which supplies the essential estimate (4.5) in Step III of the proof of Theorem 1.1, is proved only for a finite set X0 satisfying (A1)–(A4). In the application, the natural choice is X0 = Crit(f), as suggested by the set W_r constructed in Step I. For a non-recurrent polynomial with a critical orbit relation f^n(c_1) = c_2 for some n ≥ 2, Assumption (A4) fails because the intermediate points f(c_1), ..., f^{n-1}(c_1) are not critical points. Remark 3.1 explicitly acknowledges this and asserts that Theorem 3.4 remains true under weaker hypotheses, but no proof is supplied. Since estimate (4.5) is precisely what forces η_{r,n} toward the identity and is used to prove χ_r → id and hence the landing, the main theorem is not established for such polynomials by the arguments in the manuscript. This is a load-bearing gap, not a presentation issue.","section":"§3.4, Theorem 3.4 and Remark 3.1"},{"comment":"The paper states that η_{r,n+1} is univalent on C \\ ⋃_{0≤i≤n} F_r^{-i}(W_r) and asserts the equality F_r^{-i}(W_r) = f^{-i}(W_r). However, W_r was defined in Step I as ∪_{c∈Crit(f)} W_{r,c}, i.e., only the preimage components of the disks W_{r,v} that contain critical points. The map F_r = ζ_r ∘ f is non-holomorphic on all components of f^{-1}(W_{r,v}), including those around non-critical preimages of the critical values, so the stated equality and the univalence claim do not follow from the given definitions. This affects the domain on which Theorem 3.4 is applied and needs to be clarified or corrected.","section":"§4, Step III"}],"minor_comments":[{"comment":"There are numerous typographical errors and OCR artifacts (for example, 'punctu re plane', 'whenif', and inconsistent overline notation for the Riemann sphere) that should be cleaned up.","section":"Notations"},{"comment":"The proof that the limit χ_r is affine uses the fact that the Julia set J_{f_r} is removable for quasiconformal maps; a reference for this removability statement should be provided.","section":"§4, Step IV"},{"comment":"The text references 'Figure 4' to illustrate the proof, but the figure is not included in the manuscript; please ensure the figure is present or remove the reference.","section":"§4, Step I"},{"comment":"The set X0 used in the proof of Theorem 1.1 is never explicitly named or verified; the authors should state that X0 = Crit(f) and justify why the hypotheses of Theorem 3.4 (or of the asserted generalization in Remark 3.1) hold for this choice.","section":"§3.1, (A4)"}],"recommendation":"major_revision","confidential_remarks":"The manuscript falls within the scope of the journal and attacks a meaningful problem. The central flaw is the unproved generalization of Theorem 3.4 claimed in Remark 3.1, which is necessary for the main theorem. If the authors can supply a complete proof of the generalized distortion theorem or otherwise justify the estimate (4.5) for the full class of non-recurrent polynomials, the paper would likely be acceptable. The second major point about W_r also needs to be addressed. I recommend major revision rather than outright rejection because the gap appears potentially fixable within the manuscript's scope."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"The paper extends Kiwi's landing theorem for parameter rays at critical portraits from Misiurewicz polynomials to all non-recurrent polynomials. That is a meaningful step, and the m-nested disk system is a genuine technical adaptation of Cui–Tan's machinery. The proof is largely careful, the sources are credited properly, and there is no circularity.\n\nThe main soft spot is exactly where the stress-test note points. Theorem 3.4, the crucial distortion estimate used to get (4.5), is proven only under assumptions (A1)–(A4). In the application the natural choice of X0 is Crit(f), which fails (A4) whenever one critical orbit lands on another critical point after a positive number of iterations. The intermediate points are not critical points. Remark 3.1 explicitly acknowledges that (A4) is not essential and asserts a more general version of Theorem 3.4 without proof. That unproved assertion is load-bearing: without it, estimate (4.5) is unsupported for exactly the non-recurrent polynomials that are the point of the paper.\n\nThat said, the gap looks fixable. For a non-recurrent polynomial, a critical point can hit another critical point only finitely often — otherwise the second critical point would be periodic and hence recurrent. So one can enlarge X0 to include the finitely many intermediate orbit points between critical hits, and then (A1)–(A4) hold. The authors did not write down this verification, nor did they prove the more general claim in Remark 3.1. As submitted, the main theorem is not fully proven.\n\nThe paper also does not address periodic critical portraits, but that is explicitly out of scope, not a flaw.\n\nThis deserves serious refereeing. The result is important and the method is sound; the missing piece is a repairable technical verification. A referee should ask the authors to either supply the enlarged X0 argument or give a full proof of the generalization in Remark 3.1. With that in hand, the paper would be a solid contribution. As is, I would not accept it, but I would reject with an invitation to resubmit rather than a final no.","headline":"A promising generalization of Kiwi's ray-landing theorem with a real, likely repairable gap in the key distortion estimate.","tokens_in":143,"tokens_out":3034,"would_cite":true,"duration_ms":45155,"reading_group":"yes","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["37F45","37F10"],"pacs":[],"model":"deepseek-v4-flash","headline":"For every non-recurrent polynomial, every parameter ray at a critical portrait lands at the polynomial.","keywords":["parameter rays","critical portraits","non-recurrent polynomials","ray landing","nested disk systems","distortion estimates","polynomial parameter space","connectedness locus"],"falsifier":"Work through the case of a non-recurrent cubic whose critical orbit meets a second critical point after at least two iterates. If the hidden-component argument in Proposition 3.3 can be made to run for X0=Crit(f), the missing link in Remark 3.1 is supplied; if not, that failure is a concrete obstruction. A numerical test of Theorem 1.1 for such a polynomial is to compute f_r(Θ) along the ray and verify that it converges to f as r→0.","tokens_in":17442,"feed_emoji":"🌀","tokens_out":10854,"duration_ms":108359,"temperature":0.7,"pith_summary":"This paper proves a landing theorem for parameter rays in the space of complex polynomials: if f is any non-recurrent polynomial of degree d≥2 and Θ is a critical portrait of f, then the parameter ray RC_d(Θ) lands at f. The ray RC_d(Θ) consists of all polynomials whose critical values escape to infinity at the same rate r and whose critical portrait is Θ; landing means the curve r↦f_r(Θ) converges to f as r→0. This completes the picture left by the earlier landing theorem, which covered only strictly pre-periodic portraits. A sympathetic reader should care because it shows that the combinatorial labelling of polynomials by critical portraits is compatible with convergence in parameter space: every non-recurrent polynomial is approached by a distinguished curve of escaping polynomials.","feed_headline":"Parameter rays land at every non-recurrent polynomial","feed_subtitle":"Extends ray-landing from strictly pre-periodic to all non-recurrent polynomials in any degree.","key_machinery":"The load-bearing mechanism is a distortion theorem for univalent maps defined outside small preimage disks. The paper builds, for any rational map with no recurrent critical points and any finite set X0 of critical and periodic points satisfying conditions (A1)–(A4), a family of m-nested, λ-scattered disk systems around the backward orbit of X0: nested topological disks labelled by preimages, arranged so that under every univalent map h the punctured-plane area of the smaller disks is at most a fixed fraction of that of the containing disk. Proposition 2.4 and Theorem 2.5 turn this spreading property into a bound: any univalent map fixing three points of a Jordan disk in the Fatou set is uniformly close to the identity on that disk, with the closeness controlled by the size of the omitted disks. Theorem 3.4 is the key application: it says that for any δ>0, univalent maps defined off the pullbacks $f^{{-n}}$(B(x',δ)) are uniformly δ-close to the identity on a fixed Fatou disk. This estimate is what makes the iterated uniformization maps η_{r,n} converge to the identity and carries the landing conclusion.","core_discovery":"On the paper's own terms, the central discovery is Theorem 1.1: let Θ be a critical portrait of a non-recurrent polynomial f of degree d≥2. Then the parameter ray RC_d(Θ) lands at f, meaning lim_{r→0} f_r(Θ)=f. A critical portrait records, for each critical point, the set of external ray arguments landing at it. The proof starts by cutting f along an equipotential curve and performing quasiconformal surgery so that all critical values escape at a common rate r, producing a topological polynomial F_r. It shows F_r is c-equivalent to the unique polynomial f_r(Θ) with portrait Θ and escaping rate r, then runs an iterated uniformization scheme to build a sequence f_{r,n} of polynomials converging to f_r. A new distortion result for univalent maps off nested disk systems ensures that the accompanying normalizing maps η_{r,n} are uniformly close to the identity, which forces f_{r,n}→f as r→0 and hence the ray lands.","pith_inferences":["If the unproved generalization asserted in Remark 3.1 is supplied, the same construction should prove landing for parameter rays at critical portraits of non-recurrent rational maps, not only polynomials, since the surgery and distortion steps are stated for rational maps.","The proof leaves the rate of landing unspecified; a natural testable extension is to seek a power law f_r(Θ)-f = O(r^κ) for strictly pre-periodic rays, where classical estimates may make κ explicit.","Because a non-recurrent polynomial can admit finitely many distinct critical portraits, the theorem implies each such portrait gives its own landing curve; comparing these curves near f could reveal which portrait labels persist under small perturbations of f."],"forward_implications":["Every non-recurrent polynomial of degree d≥2 is the landing point of a parameter ray for each of its critical portraits.","The earlier landing theorem for strictly pre-periodic critical portraits is included as the special case where the non-recurrent polynomial is strictly post-critically finite.","The map r↦f_r(Θ), which was known to be an injective curve in the shift locus, extends continuously to r=0 with limit f.","The ray landing gives a new route showing that non-recurrent polynomials lie in the closure of the shift locus along a canonically defined curve, not merely as a limit of arbitrary escaping polynomials.","Theorem 3.4 provides a general distortion-control tool for rational maps without recurrent critical points that can be applied beyond parameter-ray landing."],"supporting_citations":[{"why":"Develops the distortion theory of nested, scattered disk systems and the modulus-difference estimates that the present Theorem 3.4 extends.","marker":"[5]"},{"why":"Gives the pullback-style proof of ray landing for quadratic Misiurewicz polynomials that this paper adapts to all non-recurrent polynomials.","marker":"[3]"},{"why":"Proved landing for strictly pre-periodic critical portraits and supplied the existence and uniqueness of f_r(Θ) defining the parameter ray.","marker":"[8]"},{"why":"Supplies the backward-stability lemma used throughout Section 3 to control pullbacks of small disks.","marker":"[12]"},{"why":"Introduces the c-equivalence relation for branched coverings that connects the surgically modified map F_r to the polynomial f_r.","marker":"[4]"},{"why":"Establishes local connectivity of the Julia set for the relevant non-recurrent polynomials, so critical points can be labelled by landing external rays.","marker":"[2]"},{"why":"Proves the classical landing theorem for rational parameter rays in the quadratic family, the d=2 case of the present result.","marker":"[6]"}],"fun_headline_variants":["Parameter rays land at all non-recurrent critical portraits","Ray landing theorem broadened to non-recurrent polynomials","Non-recurrent polynomials: every parameter ray lands","Distortion theory settles ray landing for non-recurrent maps","All non-recurrent polynomials have landing parameter rays"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The load-bearing premise is that the key distortion estimate remains true when the chosen finite set X0 (the critical points plus periodic points) need not be closed under forward iteration; a critical orbit that hits another critical point after two or more steps violates condition (A4), and the paper's Remark 3.1 asserts, without proof, that the estimate survives precisely this case.","fun_headline_variants_meta":{"raw":{"variants":["Parameter rays land at all non-recurrent critical portraits","Ray landing theorem broadened to non-recurrent polynomials","Non-recurrent polynomials: every parameter ray lands","Distortion theory settles ray landing for non-recurrent maps","All non-recurrent polynomials have landing parameter rays"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000568,"raw_usage":{"total_tokens":2602,"prompt_tokens":774,"completion_tokens":1828,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":390,"completion_tokens_details":{"reasoning_tokens":1753}},"tokens_in":390,"tokens_out":1828,"duration_ms":13094,"temperature":1.0,"reasoning_tokens":1753,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-14T11:24:42.557322+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Work through the case of a non-recurrent cubic whose critical orbit meets a second critical point after at least two iterates. If the hidden-component argument in Proposition 3.3 can be made to run for X0=Crit(f), the missing link in Remark 3.1 is supplied; if not, that failure is a concrete obstruction. A numerical test of Theorem 1.1 for such a polynomial is to compute f_r(Θ) along the ray and verify that it converges to f as r→0.","supporting_citations":[{"cited_title":"Hyperbolic-parabolic deformations of rational maps","cited_arxiv_id":"1501.01385","evidence_quote":"Develops the distortion theory of nested, scattered disk systems and the modulus-difference estimates that the present Theorem 3.4 extends."},{"cited_title":"3(2010), 625-634","cited_arxiv_id":null,"evidence_quote":"Gives the pullback-style proof of ray landing for quadratic Misiurewicz polynomials that this paper adapts to all non-recurrent polynomials."},{"cited_title":"London Math","cited_arxiv_id":null,"evidence_quote":"Proved landing for strictly pre-periodic critical portraits and supplied the existence and uniqueness of f_r(Θ) defining the parameter ray."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Supplies the backward-stability lemma used throughout Section 3 to control pullbacks of small disks."},{"cited_title":"Math., vol","cited_arxiv_id":null,"evidence_quote":"Introduces the c-equivalence relation for branched coverings that connects the surgically modified map F_r to the polynomial f_r."},{"cited_title":"Julia and John, Bol","cited_arxiv_id":null,"evidence_quote":"Establishes local connectivity of the Julia set for the relevant non-recurrent polynomials, so critical points can be labelled by landing external rays."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Proves the classical landing theorem for rational parameter rays in the quadratic family, the d=2 case of the present result."}],"review_version":1}