{"id":"2436640f-0648-4850-8115-7eb4ee1b4672","arxiv_id":"2411.16385","paper_version":1,"verdict":"ACCEPT","confidence":"MODERATE","novelty_score":7.0,"correctness_risk":"low","formal_verification":"none","parameter_count":3,"one_line_summary":"A new explicit coefficient-based root bound achieves worst-case relative overestimation 1.4655n, within 2% of the optimal lower bound for n at least 85.","lead":"This paper constructs a new explicit upper bound on the largest root modulus of a polynomial using only the absolute values of its coefficients. The bound's worst-case overestimation is 1.4655 times the degree n, which is within about two percent of the best possible value in this class for large n.","discovery_kind":"extension","skeptic_critique":{"model":"deepseek-v4-flash","headline":"Theorem 3.1's key bound φ≤0.4264 relies on an incorrect numerical value for c5; with the printed value 0.4518, the maximum is c5 and the claimed 1.4655n constant fails. Correcting c5 to ≈0.3839 restores the theorem.","rationale":"I traced the central derivation: the companion-matrix scaling, the Ostrowski-Brauer Cassini ovals, the row-sum estimates (4), and the enclosure of each oval by a circle are all valid. The reader's identified weakest assumption, the Cassini inclusion theorem, is standard and is not where the argument fails. The real defect is in Section 3.1's numerical bound on φ = τ/(nμ). The displayed value c5 = 0.4518 is arithmetically inconsistent: it is not 1/⁵√120, and with that value the claimed maximum over c3, c4, c5, ... is c5, not c3. Taking φ = 0.4518 makes the Γ/(nμ) estimate exceed 1.4655, so Theorem 3.1 as printed does not follow. However, this is a corrigible numerical error, not a conceptual one: with the correct c5 ≈ 0.3839, c3 remains the maximum and the stated bound 1.4655n and the 5% and 2% claims are recovered. A conditional acceptance, pending correction of this constant, is therefore the appropriate outcome. I do not see a reason to reject the paper, and the Cassini-based construction itself appears sound.","tokens_in":74,"tokens_out":23472,"duration_ms":453816,"concrete_test":"Independently recompute the constants: c3 = ∛(1/12.9) ≈ 0.4264, c4 = ⁴√(1/48) ≈ 0.3799, and for k ≥ 5, c_k = (1/k!)^{1/k}, in particular c5 = (1/120)^{1/5} ≈ 0.3839. Confirm that c3 is the maximum. Then evaluate the four Γ/(nμ) expressions — √(9.45φ), √3.15·√(φ² + 1/2), (1 + √(1 + 12.6φ²))/2, and (1 + √(3 + 4φ²))/2 — at φ = c3; the largest should be 1.4655. If instead the printed c5 = 0.4518 is used, the second term gives ≈ 1.489, so the proof must be amended before the headline claim can be accepted.","verdict_should_be":"CONDITIONAL","load_bearing_attack":"In the proof of Theorem 3.1, the author sets c5 := 1/5√120 ∼ 0.4518. The actual value is (1/120)^{1/5} ≈ 0.3839; 0.4518 is instead (1/24)^{1/4}. The proof then claims φ ≤ max{c3; c4, c5, ..., cn} = c3 ≈ 0.4264. With the printed c5 = 0.4518, max{c3, c5} = 0.4518 > 0.4264, so the bound φ ≤ c3 is false as written. This is numerically load-bearing: inserting φ = 0.4518 into the dominant term √3.15·√(φ² + 1/2) gives ≈ 1.489, not ≤ 1.4655, so Theorem 3.1's constant is not established by the displayed argument. The error is confined to the arithmetic value of c5: replacing it by (1/120)^{1/5} ≈ 0.3839 makes c3 the maximum and reproduces the final bound 1.4655. The Cassini-oval inclusion theorem and the row-sum estimates in equation (4) are standard and check out; the soft spot is the numerical control of φ in Section 3.1.","agreement_with_reader":"partial"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper proposes an explicit, coefficient-based upper bound Γ(p) for the largest root modulus of a monic complex polynomial of degree n≥3. The construction uses a similarity-scaled Frobenius companion matrix, the Ostrowski-Brauer Cassini oval inclusion theorem, and circle enclosures of the resulting ovals to obtain a closed-form bound involving only the last few coefficients. The main result, Theorem 3.1, claims that Γ(p)/μ(p) ≤ 1.4655n, which lies within 5% of van der Sluis's optimality threshold for n≥11 and within 2% for n≥85. The paper also compares Γ(p) with the Cauchy bound and Fujiwara's bound, and proposes a min with Fujiwara's bound as a combined estimate.","tokens_in":6144,"tokens_out":11425,"duration_ms":100242,"significance":"If the stated theorem is correct, this is a strong result: it gives a simple, low-cost algebraic bound whose worst-case relative overestimation is close to the information-theoretic lower bound for absolute root bounds, improving on the classical Fujiwara bound's factor 2n and on earlier modifications from the literature. The proof is explicit and the constants 2.15, 2, and 3.15 are transparent design choices rather than fitted parameters. The paper's contribution is therefore significant for the theory of polynomial root bounds, provided the numerical issue identified below is repaired.","major_comments":[{"comment":"The numerical value assigned to c5 is incorrect. The text defines c5 := 1/5√120 ≈ 0.4518. If this means 1/(120)^{1/5}, the value is approximately 0.3839; the number 0.4518 is instead (1/24)^{1/4}. With the printed value c5 = 0.4518, the line φ ≤ max{c3, c4, c5, ..., cn} = c3 ≈ 0.4264 is false, since c5 > c3. Substituting φ = 0.4518 into the four displayed terms of Γ(p)/(nμ(p)) gives approximately 1.389, 1.489, 1.445, and 1.477, so the maximum is about 1.489 rather than the claimed 1.4655. This is load-bearing because the theorem's constant depends on the maximum being attained at c3. Replacing 0.4518 by the correct 0.3839 makes c3 the maximum and reproduces the stated 1.4655n; thus the theorem is repairable, but the proof as printed does not establish it.","section":"Section 3.1, proof of Theorem 3.1"}],"minor_comments":[{"comment":"The displayed formula for sqrt(r_i(τ) r_j(τ)) assumes both rows i and j have the leading subdiagonal term t; for i=1 or j=1 the reduced row sum is |a0|/τ^{n-1} rather than t + |a_{i-1}|/τ^{n-i}. The subsequent estimate remains valid because τ ≥ |a0|^{1/n} implies r1/τ ≤ 1, but this should be stated explicitly to avoid an apparent minor gap.","section":"Section 2, proof of Proposition 2.1, case 1"},{"comment":"The notation c5 := 1/5√120 is ambiguous in print; the intended expression should be written as 1/√[5]{120} or (120)^{-1/5}, and the decimal value should be corrected accordingly.","section":"Section 3.1"},{"comment":"The statement that 42 of the 45 bounds in [9, Chap. 1] exceed the optimal threshold, with exceptions A5, A6 and B5, would benefit from a precise table or list reference, since that enumeration is not immediately verifiable from the text.","section":"Section 1.1"}],"recommendation":"major_revision","confidential_remarks":null},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Prashant Batra's note is a serious candidate for publication, but the proof of the main theorem has a numerical typo that must be corrected before the claim stands. The specific value c5 as printed (0.4518) is not 1/sqrt[5]{120}; that is actually (1/24)^{1/4}. The correct fifth root gives about 0.3839, which is below c3 ≈ 0.4264. With the printed value, φ ≤ max{c3,c5} = 0.4518, and the displayed maximum 1.4655 does not follow. This is a genuine gap in the written proof, but it is a one-line arithmetic fix; the intended argument is sound.\n\nWhat is genuinely new: the explicit bound Γ(p) and the worst-case overestimation 1.4655n. The construction is standard—companion matrix scaled by τ, Cassini ovals, then enclosing each oval by a circle—but the tuning of the constants (2.15, 2, 3.15) to get within 2 percent of van der Sluis's lower bound is careful and not fitted to examples. The comparison with the Cauchy bound in Section 3.2 is also a nice extra. The paper is written honestly; the references are appropriate, and the only self-citation is to the prior 1.58n bound, which is entirely reasonable.\n\nOther soft spots are minor. The notation τ as both a parameter and the max expression is slightly confusing. The τ=0 case is dispatched in one sentence; it should at least be stated that the quadratic factor can be handled directly. There are no numerical experiments, but for a worst-case theoretical bound that is fine; the van der Sluis benchmark is the right measure.\n\nOverall, the core idea holds up after the c5 correction. The paper deserves a serious referee: it answers a question that has been open since 1970 in a nearly sharp way, with an explicit, computationally cheap bound. I would send it out, but I would require the author to correct the c5 computation and to double-check the few surrounding inequalities. For a reader in numerical analysis or polynomial root location, this is worth a close look.","headline":"A useful near-optimal root bound that survives a numerical typo in the proof; worth a referee after a one-line fix.","tokens_in":6705,"tokens_out":2602,"would_cite":true,"duration_ms":23858,"reading_group":"maybe","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["65H04","15A18","12D10"],"pacs":[],"model":"deepseek-v4-flash","headline":"An explicit coefficient-only formula bounds every polynomial's largest root within 5 percent of the theoretical floor once the degree reaches 11.","keywords":["upper bounds for polynomial roots","a priori bounds","Cassini ovals","root modulus","worst-case overestimation","companion matrix","van der Sluis threshold","Fujiwara bound"],"falsifier":"Take the extremal family of monic polynomials that attains the lower threshold for $n\\ge3$, compute $\\mu(p)$ numerically, and evaluate the explicit formula $\\Gamma(p)$; if $\\Gamma(p)/\\mu(p)>1.4655\\,n$ for any $n$, Theorem 3.1 is false. The same check can be run as a random search over coefficient profiles because both quantities are directly computable.","tokens_in":5620,"feed_emoji":"🧮","tokens_out":19813,"duration_ms":159843,"temperature":0.7,"pith_summary":"This paper constructs an explicit, coefficient-only upper bound $\\Gamma(p)$ for the largest modulus of a root of any monic complex polynomial of degree $n\\ge3$, and proves that its worst-case relative overestimation satisfies $\\Gamma(p)/\\mu(p)\\le1.4655\\,n$, where $\\mu(p)$ is the true largest root modulus. Since any absolute root bound---one using only the coefficient moduli---has worst-case overestimation at least about $1.442\\,n$, the new bound is nearly optimal: for $n\\ge11$ it is within 5 percent of the theoretical floor, and for $n\\ge85$ within 2 percent. The point is that the optimal Cauchy bound is not available as a closed algebraic expression, while $\\Gamma(p)$ is a simple formula in the coefficients that can be evaluated immediately. This supplies a guaranteed, choice-free quality assessment that does not depend on selected test polynomials.","feed_headline":"Explicit root bound within 5 percent of the theoretical optimum","feed_subtitle":"For degree n≥11, the coefficient-only bound overestimates the largest root modulus by at most 1.4655n.","key_machinery":"The central object is the family of similarity-scaled companion matrices $C(t)=S(t)C_F S(t)^{-1}$ with $S(t)=\\operatorname{diag}(1,t,\\ldots,t^{n-1})$, whose eigenvalues are exactly the roots of $p$. The Ostrowski–Brauer theorem places those eigenvalues in the union of Cassini ovals $O_{i,j}(t)=\\{z\\in\\mathbb{C}:|z-c_{ii}(t)|\\,|z-c_{jj}(t)|\\le r_i(t)r_j(t)\\}$, with $r_i(t)$ the reduced row sums of $C(t)$. The parameter is fixed at $t=\\tau$ so that the row-sum factors $(1+|a_{k-1}|/\\tau^{n+1-k})$ are bounded by $2$, $3$, and $3.15$ according to $k$, letting each oval be enclosed in an explicit circle. Vieta's coefficient estimates then convert those radii into the numerical constant $1.4655$ after dividing by $n\\mu(p)$.","core_discovery":"Let $p(z)=z^n+\\sum_{i=0}^{n-1}a_i z^i$ be monic and let $\\mu(p)$ be the largest modulus of its roots. With $$\\tau=\\max\\left\\{\\sqrt[3]{\\frac{|a_{n-3}|}{2.15}},\\sqrt[4]{\\frac{|a_{n-4}|}{2}},\\sqrt[5]{|a_{n-5}|},\\ldots,\\sqrt[n]{|a_0|}\\right\\},$$ the paper defines $$\\Gamma(p)=\\max\\left\\{\\sqrt{3.15}\\sqrt{\\$tau^{2}$+\\max\\{|a_{n-2}|,2\\$tau^{2}$\\}},\\ \\frac{|a_{n-1}|+\\sqrt{|a_{n-1}|^2+4(\\$tau^{2}$+\\max\\{|a_{n-2}|,2.15\\$tau^{2}$\\})}}{2}\\right\\}$$ and proves $\\mu(p)\\le\\Gamma(p)$ for every monic polynomial of degree $n\\ge3$. Theorem 3.1 then bounds the worst-case relative overestimation by $\\Gamma(p)/\\mu(p)\\le1.4655\\,n$; the proof uses the estimates $|a_{n-k}|\\le\\binom{n}{k}\\mu(p)^k$ to reduce the coefficient profile to the one number $\\varphi=\\tau/(n\\mu(p))\\le0.4264$ and then evaluates the four circle radii that enclose the Cassini ovals. Because the lower threshold (2) of the paper says no absolute root bound can do better than about $1.442\\,n$, this explicit $\\Gamma(p)$ reaches within 5 percent of optimal for $n\\ge11$ and within 2 percent for $n\\ge85$.","pith_inferences":["The same mechanism---diagonal scaling of a companion matrix followed by Cassini oval enclosure---could plausibly produce explicit, near-optimal spectral bounds for other structured eigenvalue problems, since the scaling parameter can be tuned to the entry magnitudes.","The constants $2$, $2.15$, $3.15$, and the intermediate estimates $c_k$ are chosen for a short proof; a more careful optimization, especially for small degrees, could lower the constant $1.4655$, and computing exact worst-case ratios for $n=3,\\ldots,10$ would test its sharpness.","Worst-case optimality says nothing about typical performance; on coefficient distributions with a few dominant coefficients, $\\Gamma(p)$ may be much tighter than $1.4655\\,n$, and a numerical benchmark suite would quantify that gap."],"forward_implications":["For any monic polynomial of degree $n\\ge3$, $\\Gamma(p)$ is an explicit bound computed directly from the coefficient moduli, so it can be evaluated in linear time without locating any roots.","The worst-case overestimation of the largest root modulus is at most $1.4655\\,n$, which for $n\\ge11$ is within 5 percent of the best possible factor for any absolute root bound, and for $n\\ge85$ within 2 percent.","The same bound overestimates the Cauchy bound by at most $\\sqrt{9.45}\\approx3.07$, and the combined bound $\\min\\{\\Gamma(p),F(p)\\}$ stays within twice the Cauchy bound while keeping the near-optimal overestimation of $\\mu(p)$.","Because the quality measure is the worst case over all polynomials of fixed degree, the guarantee is choice-free and independent of coefficient distributions or test examples."],"supporting_citations":[{"why":"Supplies the lower threshold for any absolute root bound that Theorem 3.1 compares against.","marker":"[16]"},{"why":"Provides the Cassini oval (Ostrowski–Brauer) inclusion theorem used to locate the eigenvalues of the scaled companion matrix.","marker":"[17]"},{"why":"Catalogues standard absolute root bounds and companion-matrix facts that the new bound competes with.","marker":"[14]"},{"why":"Defines the Fujiwara bound $F(p)$ whose overestimation is the benchmark and which is combined with $\\Gamma(p)$.","marker":"[3]"},{"why":"Supplies the closed form for the farthest point of an oval $|z+a||z|\\le g$, used in the proof of Proposition 2.1.","marker":"[12]"},{"why":"Gives the previous explicit bound with $1.58n$ worst-case overestimation that the paper improves to $1.4655n$.","marker":"[1]"}],"fun_headline_variants":["Explicit root bound within 5% of optimal","Nearly optimal root modulus bound","Root bound: 5% off theoretical optimal","Coefficient-only bound near-optimal for roots","Polynomial root bound reaches within 5% of limit"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The explicit formula is only a proven upper bound if the standard eigenvalue-inclusion theorem for Cassini ovals really does trap every root of the scaled companion matrix, together with the row-sum inequalities used to shrink the ovals.","fun_headline_variants_meta":{"raw":{"variants":["Explicit root bound within 5% of optimal","Nearly optimal root modulus bound","Root bound: 5% off theoretical optimal","Coefficient-only bound near-optimal for roots","Polynomial root bound reaches within 5% of limit"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000421,"raw_usage":{"total_tokens":2164,"prompt_tokens":945,"completion_tokens":1219,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":561,"completion_tokens_details":{"reasoning_tokens":1149}},"tokens_in":561,"tokens_out":1219,"duration_ms":30168,"temperature":1.0,"reasoning_tokens":1149,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-12T13:12:01.795553+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Take the extremal family of monic polynomials that attains the lower threshold for $n\\ge3$, compute $\\mu(p)$ numerically, and evaluate the explicit formula $\\Gamma(p)$; if $\\Gamma(p)/\\mu(p)>1.4655\\,n$ for any $n$, Theorem 3.1 is false. The same check can be run as a random search over coefficient profiles because both quantities are directly computable.","supporting_citations":[{"cited_title":"Upperbounds for Roots of Polynomials","cited_arxiv_id":null,"evidence_quote":"Supplies the lower threshold for any absolute root bound that Theorem 3.1 compares against."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Provides the Cassini oval (Ostrowski–Brauer) inclusion theorem used to locate the eigenvalues of the scaled companion matrix."},{"cited_title":"I.; Schmeisser, G","cited_arxiv_id":null,"evidence_quote":"Catalogues standard absolute root bounds and companion-matrix facts that the new bound competes with."},{"cited_title":"¨Uber die obere Schranke des absoluten Betrages der Wurzeln einer algebraischen Gleichung","cited_arxiv_id":null,"evidence_quote":"Defines the Fujiwara bound $F(p)$ whose overestimation is the benchmark and which is combined with $\\Gamma(p)$."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Supplies the closed form for the farthest point of an oval $|z+a||z|\\le g$, used in the proof of Proposition 2.1."},{"cited_title":"Improvements of Lagrange’s bound for polynomial roots","cited_arxiv_id":null,"evidence_quote":"Gives the previous explicit bound with $1.58n$ worst-case overestimation that the paper improves to $1.4655n$."}],"review_version":1}