{"id":"3f9b63ab-2b4f-4598-8c05-2fc9afd7a45e","arxiv_id":"2607.06578","paper_version":1,"verdict":"ACCEPT","confidence":"HIGH","novelty_score":6.0,"correctness_risk":"low","formal_verification":"none","parameter_count":0,"one_line_summary":"Under |φ_n|+ψ_n<0, GKP polynomials have real simple interlacing zeros between the roots of the driving quadratic, with explicit extreme-zero asymptotics when ψ is constant.","lead":"The paper defines GKP polynomial sequences by a first-order differential recurrence and proves that, under a mild sign condition, all zeros are real, simple, lie between the two roots of the driving quadratic, and interlace from degree to degree. It also gives asymptotics for extreme zeros when one parameter sequence is constant (or eventually constant), covering tangent, secant, Eulerian and Jacobi polynomials as special cases.","discovery_kind":"extension","skeptic_critique":{"model":"grok-4.5","headline":"No significant objection identified","rationale":"The Reader correctly isolates the uniform sign condition as the essential hypothesis and notes that the paper already quantifies what happens when it is dropped. The elementary inductive argument via Lemmas 3.1–3.4 is complete and self-contained; the coefficient asymptotics of Lemma 5.1 feed cleanly into the general zero-asymptotics theorem of the Appendix. The open conjecture and the non-vanishing side-condition (1.9) are explicitly flagged. No load-bearing technical flaw is present, so the ACCEPT verdict stands.","tokens_in":31030,"tokens_out":501,"duration_ms":5537,"concrete_test":"For the classical special cases (tangent/secant polynomials with φ=0, ψ=0 or -1; Eulerian polynomials after the affine map; Jacobi polynomials with the indicated φ,ψ sequences), recompute the first 20 zeros of s_n numerically and verify that they lie in (-1,1), are simple, and interlace those of s_{n-1}, matching the predictions of Theorem 1.1 under the sign condition.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The central claim (Theorem 1.1 and its extensions) rests on the uniform sign condition |φ_n|+ψ_n<0, which is used in Lemmas 3.2–3.4 to force an odd number of zeros of q in every interval determined by consecutive zeros of p together with {±1}. The induction then yields simple zeros in (-1,1) and interlacing. The paper itself marks the necessity of the condition (Corollary 4.4 gives only a lower bound on the number of real zeros when it fails; Lemma 6.4 exhibits permanent complex zeros when the auxiliary polynomial P vanishes at the critical points). The asymptotic statements (Theorems 1.2 and 6.2) are derived from a general coefficient-asymptotics result (Theorem 5.2) whose hypotheses are verified by direct computation for the constant and eventually-constant cases. No internal gap, circularity, or unstated hypothesis appears in the chain from the sign condition to the stated conclusions.","agreement_with_reader":"agree"},"referee_report":{"model":"grok-4.5","summary":"The paper defines GKP sequences of polynomials via the recurrence p_n = (ax^{2}+bx+c)p'_{n-1} + (φ_n + ψ_n x)p_{n-1} (with ax^{2}+bx+c having two distinct real zeros) and studies their zeros. After an affine reduction to the model family s^{φ,ψ}_n on (−1,1), Theorem 1.1 asserts that the uniform condition |φ_n| + ψ_n < 0 forces all zeros of s_n to be real and simple in (−1,1) with interlacing between consecutive degrees. When ψ is constant the coefficients are symmetric in the φ-parameters, yielding monotonicity of zeros (Theorem 4.2). For constant and eventually-constant parameters the extreme zeros admit explicit asymptotics (Theorems 1.2 and 6.2), obtained from a general coefficient-asymptotics theorem (Theorem 5.2) proved in the appendix; linear combinations of the constant-parameter family are treated in Theorem 1.3, which locates the zeros relative to (−1,0) according to the sign pattern of an auxiliary polynomial P.","tokens_in":31230,"tokens_out":783,"duration_ms":7857,"significance":"The work supplies a uniform real-rootedness and interlacing theory that covers several classical families (tangent/secant, Eulerian, Jacobi) as special cases of a single recurrence. The elementary but carefully case-split zero lemmas (3.1–3.4) and the general asymptotic engine of Theorem 5.2 are reusable tools; the latter is of independent interest for any coefficient sequence that is asymptotically of the form F(j)G(j)^n with log-concave F and G. The results are self-contained, free of fitted parameters, and the necessity of the sign hypothesis is documented by partial results (Corollary 4.4) and counter-examples (Lemma 6.4).","major_comments":[],"minor_comments":[{"comment":"In the statement of Theorem 1.1 the condition is written “|φ_n| + ψ_n < 0 for every n ≥ 0”; the sequences begin at n = 1, so the range should be n ≥ 1 (or the sequences should be extended by a dummy index).","section":null},{"comment":"Definition 3.1 of interlacing is non-standard in requiring min(U) < min(V); a brief remark that this is the convention used throughout would prevent confusion with the usual symmetric notion.","section":null},{"comment":"The generating function displayed at the end of §5 is stated without proof; a one-line verification from the PDE, or a reference, would be helpful.","section":null},{"comment":"In Lemma 5.1 the binomial coefficient (−u + j − 1 choose j) is written with a negative upper index; an explicit remark that it is understood via the usual generalized binomial formula would remove any ambiguity.","section":null},{"comment":"A few typographical inconsistencies appear (e.g., “s ϕ,ψ n ” versus “s^{φ,ψ}_n”, occasional missing spaces around operators). A light copy-edit pass would improve readability.","section":null}],"recommendation":"accept","confidential_remarks":"The manuscript is solid and ready for publication. The only possible scope question is whether math.GM is the optimal venue; the content is classical real analysis / orthogonal polynomials and would also fit a journal such as Journal of Approximation Theory or Constructive Approximation. That is an editorial decision, not a scientific objection."},"author_rebuttal":null,"desk_editor":{"model":"grok-4.5","letter":"This paper cleanly packages real-rootedness, interlacing, and extreme-zero asymptotics for the GKP recurrence that already contains tangent/secant, Eulerian, and Jacobi polynomials. The core is Theorem 1.1: under the uniform condition |φ_n| + ψ_n < 0 the zeros of s_n^{φ,ψ} are simple, lie in (-1,1), and interlace. The argument is elementary (sign-change lemmas that carefully case-split relative to ±1, then induction) and complete for what is claimed. When ψ is constant one also gets symmetry in the φ-parameters, monotonicity of zeros, and a useful representation as a linear combination of the constant-coefficient family. The constant and eventually-constant cases then yield explicit asymptotics for the leftmost and rightmost zeros via a general coefficient-asymptotics lemma proved in the appendix; that lemma is of independent interest and is applied carefully.\n\nWhat is new is the unified class itself together with the interlacing-plus-asymptotics package under an explicit, checkable hypothesis. Prior work on the Graham–Knuth–Patashnik recurrence and on individual families is cited appropriately; the self-citations supply background identities that are independently verifiable. Soft spots are minor and already flagged by the authors: the sign condition is essential (without it one obtains only a lower bound on the number of real zeros, and a simple example produces permanent complex zeros when the auxiliary polynomial vanishes at the critical points). There is an open conjecture that the operator still produces only real zeros for large n even when the auxiliary polynomial has complex zeros, provided it avoids those critical points; that is left open, not papered over. No circularity, no free parameters, no hidden normalizations.\n\nThis is for people who work on real-rootedness, interlacing, or asymptotics of combinatorial/orthogonal polynomials. The proofs are short enough to check by hand and the statements are precise. I would send it to referees without hesitation; it is a correct, self-contained contribution of the expected scope for the special-functions community. Engage if that is your area; otherwise file it as a clean reference for the GKP class and the extreme-zero formulae.","headline":"Solid, self-contained real-rootedness and extreme-zero asymptotics for a natural recurrence class that unifies several classical families; the sign condition is essential and clearly marked.","tokens_in":31854,"tokens_out":571,"would_cite":true,"duration_ms":6150,"reading_group":"maybe","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["33C45","26C10","30C15"],"pacs":[],"model":"grok-4.5","headline":"Under a simple sign condition, every GKP polynomial has only real simple zeros that interlace and stay between the two fixed roots of the quadratic factor.","keywords":["GKP polynomials","real zeros","interlacing","tangent polynomials","secant polynomials","Eulerian polynomials","Jacobi polynomials","asymptotics of zeros"],"falsifier":"Compute the first twenty polynomials of a GKP sequence that violates |φ_n| + ψ_n < 0 for some n (or for which the auxiliary polynomial P vanishes at a critical point u±v-2l) and check whether any non-real zeros appear; the paper itself exhibits permanent complex zeros in the latter case.","tokens_in":31930,"feed_emoji":"√️","tokens_out":744,"duration_ms":6484,"temperature":0.7,"pith_summary":"The paper introduces GKP sequences of polynomials by the first-order recurrence that multiplies the previous derivative by a fixed quadratic with two distinct real roots and adds a linear term whose coefficients form two free sequences. Classic families—tangent and secant polynomials, Eulerian polynomials, and Jacobi polynomials—all arise this way. The central claim is that a uniform inequality on those free coefficients forces every polynomial in the sequence to have only real, simple zeros lying strictly between the two roots of the quadratic, and that consecutive polynomials interlace. When one coefficient sequence is constant and the other eventually constant, the same machinery also yields precise asymptotics for the extreme zeros and shows that finite linear combinations remain real-rooted for large degree, with a controlled number of zeros that escape the original interval.","feed_headline":"GKP polynomials have only real interlacing zeros","feed_subtitle":"A uniform sign condition on free coefficients forces every zero between the two fixed roots of the quadratic factor.","key_machinery":"The differential operator Ω(a,b)p = (1-x^{2})p' + (a+bx)p together with the sign-change lemmas that locate an odd number of zeros of Ω(a,b)p in every interval determined by consecutive zeros of p and the points ±1. Induction on these lemmas yields global real-rootedness and interlacing.","core_discovery":"If |φ_n| + ψ_n < 0 for every n, then every GKP polynomial s^{φ,ψ}_n has only simple zeros inside (-1,1) and the zeros of s^{φ,ψ}_{n+1} interlace those of s^{φ,ψ}_n. The same conclusion, after an affine change of variable, holds for the general GKP recurrence built from any quadratic with two distinct real roots.","pith_inferences":[],"forward_implications":[],"fun_headline_variants":["GKP polynomials zeros stay real simple and interlacing","Sign condition puts all GKP zeros between quadratic roots","GKP recurrence yields real interlacing zeros in the gap","Zeros of every GKP polynomial interlace and stay real","Mild sign rule forces real simple zeros for GKP sequences"],"cache_read_input_tokens":16512,"weakest_assumption_plain":"The uniform sign condition |φ_n| + ψ_n < 0 must hold for every index n; if it fails even for one n the forcing of all zeros into (-1,1) and the interlacing argument can break.","fun_headline_variants_meta":{"raw":{"variants":["GKP polynomials zeros stay real simple and interlacing","Sign condition puts all GKP zeros between quadratic roots","GKP recurrence yields real interlacing zeros in the gap","Zeros of every GKP polynomial interlace and stay real","Mild sign rule forces real simple zeros for GKP sequences"]},"model":"grok-4.5","effort":"low","cost_usd":0.004586,"raw_usage":{"total_tokens":1375,"prompt_tokens":820,"num_sources_used":0,"completion_tokens":81,"cost_in_usd_ticks":45860000,"prompt_tokens_details":{"text_tokens":820,"audio_tokens":0,"image_tokens":0,"cached_tokens":256},"completion_tokens_details":{"audio_tokens":0,"reasoning_tokens":474,"accepted_prediction_tokens":0,"rejected_prediction_tokens":0}},"tokens_in":820,"tokens_out":81,"duration_ms":4494,"temperature":1.0,"reasoning_tokens":474,"cache_read_input_tokens":256,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-07-12T06:44:41.043143+00:00","model_set":{"reader":"grok-4.5"},"falsifier":"Compute the first twenty polynomials of a GKP sequence that violates |φ_n| + ψ_n < 0 for some n (or for which the auxiliary polynomial P vanishes at a critical point u±v-2l) and check whether any non-real zeros appear; the paper itself exhibits permanent complex zeros in the latter case.","supporting_citations":[],"review_version":1}