{"id":"0ac39443-1789-4ee8-b242-f6648cc5111e","arxiv_id":"2606.24373","paper_version":2,"verdict":"ACCEPT","confidence":"HIGH","novelty_score":7.0,"correctness_risk":"low","formal_verification":"none","parameter_count":0,"one_line_summary":"Khovanskii's Bézout-type bound for Pfaffian systems is asymptotically sharp in chain-degree α (via α^s zeros) and in degrees β (via Ω(β^{n+s}) zeros).","lead":"The paper proves Khovanskii's classical upper bound on real zeros of Pfaffian systems is asymptotically sharp in the chain-degree α and the function degrees β. This supplies matching lower-bound constructions that had been missing for a foundational tool of real algebraic geometry and o-minimality.","discovery_kind":"extension","skeptic_critique":{"model":"grok-4.5","headline":"No significant objection identified","rationale":"The reader's strongest claim accurately summarises Theorems 1.2 and 1.3/Corollary 1.4, and the weakest-assumption note correctly flags the only non-trivial hypothesis of the β-result. That hypothesis is, however, proved rather than assumed: the authors construct the required chain and give a complete asymptotic proof of algebraic independence. The α-construction is likewise fully rigorous (nested intervals, local diffeomorphisms, non-degeneracy via chain rule). Both asymptotic lower bounds therefore match the dominant terms of Khovanskii's upper bound under the stated parameter regimes. The remaining open questions (sharpness in s, simultaneous α-β growth without order doubling) are acknowledged by the authors and do not undermine the proved statements. Consequently the ACCEPT verdict with low correctness risk stands; no adjustment is warranted.","tokens_in":18441,"tokens_out":611,"duration_ms":5988,"concrete_test":"Independently re-derive the algebraic-independence argument of Section 3.2 for the concrete chain q_i=exp(q_{i-1}), q0=X1+⋯+Xn, by verifying that every nonzero multi-index term is dominated by the ≺-maximal one along a generic ray γ(t)=(t,c2,…,cn); if the limit argument (3.13)–(3.14) holds for all multi-indices of total degree ≤d, the dimension count and hence Corollary 1.4 stand.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The central claims hold under the paper's own constructions. Theorem 1.2 builds nested inverse-branch intervals from the covering property of f1=exp(a p) (Lemma 3.1) and obtains α^s nondegenerate fixed points of fs by IVT plus a chain-rule lower bound |f's|>(a δ m)^s>1 for large a; the argument is self-contained and does not rely on external conjectures. For the β-direction, Corollary 1.4 supplies an explicit algebraically independent chain (iterated exponentials of the linear form X1+⋯+Xn) whose independence is proved by a standard asymptotic comparison of growth rates along rays (eqs. (3.9)–(3.14)); once independence is granted, the dimension count dim Veta=binom(eta+n+s,n+s) immediately yields the Ω(eta^{n+s}) regular zeros via a surjective evaluation map. The reader's weakest-assumption concern is therefore already discharged inside the paper. No hidden circularity, missing estimate, or regime where the constructions fail appears.","agreement_with_reader":"agree"},"referee_report":{"model":"grok-4.5","summary":"The paper studies the sharpness of Khovanskii's Bézout-type upper bound on the number of isolated real zeros of systems of Pfaffian equations, which depends on the chain-degree α, the degrees β_i of the functions, and the order s of the underlying Pfaffian chain. The authors prove two main asymptotic sharpness results. Theorem 1.2 constructs, for every α, s ∈ ℕ, a single Pfaffian function of format (α, 1, s) with at least α^s nondegenerate real zeros, matching the α^s growth in the bound. Theorem 1.3 and Corollary 1.4 show that, for fixed n and s, there exist systems of n Pfaffian functions of format (s, β, s) with Ω_{n,s}(β^{n+s}) regular common zeros, matching the growth in the β-parameters. The proofs rely on an explicit analytic construction via nested inverse branches of exp(a p(x)) for the α-result, and on a dimension-counting argument in the vector space of Pfaffian functions of degree ≤ β (combined with an algebraically independent iterated-exponential chain) for the β-result. A brief discussion of the s-dependence and a product construction combining the two regimes are also included.","tokens_in":18683,"tokens_out":770,"duration_ms":6433,"significance":"Khovanskii's theorem is a foundational quantitative result in Pfaffian geometry and o-minimality, yet its sharpness has remained largely open. Establishing that the bound is asymptotically tight in the parameters α and β (for fixed n, s) is a clear and useful contribution: it confirms that the dominant growth rates appearing in the classical estimate cannot be improved in those regimes, and it supplies concrete families of examples that attain the predicted order. The constructions are fully explicit and self-contained; the algebraic-independence argument for the iterated-exponential chain is carefully written and discharges the only non-trivial hypothesis needed for the dimension count. The work therefore strengthens the foundations of effective Pfaffian geometry and supplies useful test cases for any future improvements of the bound.","major_comments":[],"minor_comments":[{"comment":"In the statement of Theorem 1.1 the product and sum are written with a slightly awkward line-break; a single displayed formula would improve readability.","section":null},{"comment":"Figure 1 is helpful, but the caption could briefly recall that the maps are the successive restrictions of f_1 (or f_r) that realize the inverse branches.","section":null},{"comment":"In the non-degeneracy argument for G at the end of the proof of Theorem 1.2, the lower bound |f_s'| ≥ (a δ m)^s is clear, yet a one-line remark that a can be chosen after all other constants (η, δ, m, \rho, \tau) have been fixed would make the quantifiers fully transparent.","section":null},{"comment":"Section 3.3.1 compares Khovanskii’s bound with the sharper estimate of Barbagallo–Jeronimo–Sabia for polynomials in e^x; a short sentence noting that the format of such a function is (1, m+n, 1) would make the comparison self-contained.","section":null},{"comment":"A few minor typographical inconsistencies appear (e.g., “Khovanski˘ ı” vs. “Khovanskii”, occasional missing spaces around “=”). These are easily cleaned in production.","section":null}],"recommendation":"accept","confidential_remarks":"The manuscript is a clean, carefully written contribution that settles the asymptotic sharpness questions it poses. I see no reason to request further technical work; the paper is ready for acceptance."},"author_rebuttal":null,"desk_editor":{"model":"grok-4.5","letter":"This paper settles the natural question of whether Khovanskii’s bound is asymptotically sharp in the chain-degree α and the function degrees β. The answer is yes, via two explicit constructions that look carefully written and self-contained.\n\nWhat is new is Theorem 1.2: for every α,s they build a single Pfaffian function of format (α,1,s) with at least α^s nondegenerate real zeros. The engine is Lemma 3.1 (exp(a p) with p a monic product of linear factors) plus an inductive nested-interval pull-back along inverse branches, finished by IVT and a chain-rule lower bound that makes the fixed points nondegenerate for large a. Corollary 1.4 then gives, for fixed n,s, systems of format (s,β,s) with Ω(β^{n+s}) regular common zeros by dimension-counting in the vector space of format-(α,β,s) functions once an algebraically independent chain (iterated exponentials of a linear form) is in hand; the independence argument along rays is standard and works.\n\nBoth proofs are written out in full detail; the non-degeneracy estimates and the surjectivity of the evaluation map are controlled rather than hand-waved. The authors are also honest about the remaining gaps: the exponential-in-s^{2} factor is almost certainly not sharp (they give small examples and note the fewnomial literature), and their simultaneous α-β product construction doubles the order. Those are real limitations, but they are stated as open questions rather than papered over.\n\nThe citation pattern is appropriate (Khovanskii, Speissegger, Wilkie, Gabrielov–Vorobjov, and the recent fewnomial and incidence papers). No circularity or free parameters appear. This is for anyone who uses quantitative Pfaffian bounds in o-minimality, fewnomials, or incidence geometry; the lower bounds are now available for complexity estimates. It deserves a serious referee and should be published after ordinary polishing. I would bring it to reading group and cite the constructions when I next need matching lower bounds.","headline":"Clean asymptotic lower bounds matching Khovanskii in α and β; proofs hold up, s left open as expected.","tokens_in":19301,"tokens_out":534,"would_cite":true,"duration_ms":10092,"reading_group":"yes","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["14P15","14P10","03C64","32B20"],"pacs":[],"model":"grok-4.5","headline":"Khovanskii's Pfaffian zero bound is asymptotically sharp in chain-degree α and in function degrees β.","keywords":["Pfaffian functions","Khovanskii bound","fewnomials","chain-degree","o-minimality","Bézout-type bounds","algebraic independence","real zeros"],"falsifier":"Either exhibit, for some α and s, a Pfaffian function of format (α,1,s) whose number of nondegenerate real zeros is o(α^s), or show that every Pfaffian chain of order s on n variables is algebraically dependent over the rational functions, collapsing the lower bound in β.","tokens_in":19372,"feed_emoji":"√","tokens_out":837,"duration_ms":6131,"temperature":0.7,"pith_summary":"Khovanskii's theorem gives a Bézout-style upper bound on isolated real zeros of systems of Pfaffian equations, controlled by three parameters: the chain-degree α of the underlying differential chain, the polynomial degrees β of the functions themselves, and the order s of the chain. Little was known about whether those upper bounds are tight. This paper shows they are asymptotically sharp in α and in the β's. For every α and s the authors build a single Pfaffian function of format (α,1,s) that already has at least α^s nondegenerate real zeros, matching the α^s factor in the theorem. For fixed number of variables and fixed chain order they also produce systems whose number of regular common zeros grows like a positive constant times β^{n+s}, again matching the leading growth of Khovanskii's bound as the degrees tend to infinity. The constructions matter because the same bound underpins quantitative results throughout Pfaffian geometry and o-minimality; knowing which parameters are forced to grow tells practitioners where the bound is already optimal and where it might still be improvable.","feed_headline":"Pfaffian zero bound is sharp in chain-degree and in degrees","feed_subtitle":"Explicit constructions match Khovanskii's growth rates in α and in β for fixed order.","key_machinery":"A nested-interval inverse-branch construction for the α-sharpness (starting from a carefully scaled exponential of a monic polynomial with α simple roots and iteratively pulling back α intervals under the covering map) and a dimension-counting argument on the vector space of Pfaffian functions of degree β with respect to an algebraically independent chain for the β-sharpness.","core_discovery":"The dependence of Khovanskii's bound on the chain-degree α is asymptotically sharp: for every α,s there exists a Pfaffian function of format (α,1,s) with at least α^s nondegenerate real zeros. Independently, the dependence on the function degrees β is asymptotically sharp: for fixed n and s there exist Pfaffian systems of format (s,β,s) with Ω_{n,s}(β^{n+s}) regular common zeros, matching the order predicted by the theorem as β\toà∞.","pith_inferences":[],"forward_implications":[],"fun_headline_variants":["Khovanskii bound sharp in chain-degree: α^s zeros for format (α,1,s)","Pfaffian systems hit Ω(β^{n+s}) zeros matching Khovanskii growth","Parameterwise sharpness of Khovanskii bound for α and β shown","Explicit constructions prove asymptotic sharpness in α and degrees","Format (α,1,s) Pfaffians attain ≥α^s nondegenerate real zeros"],"cache_read_input_tokens":16512,"weakest_assumption_plain":"The degree-sharpness argument needs an algebraically independent Pfaffian chain of the stated order; without that independence the dimension count that produces many zeros fails.","fun_headline_variants_meta":{"raw":{"variants":["Khovanskii bound sharp in chain-degree: α^s zeros for format (α,1,s)","Pfaffian systems hit Ω(β^{n+s}) zeros matching Khovanskii growth","Parameterwise sharpness of Khovanskii bound for α and β shown","Explicit constructions prove asymptotic sharpness in α and degrees","Format (α,1,s) Pfaffians attain ≥α^s nondegenerate real zeros"]},"model":"grok-4.5","effort":"low","cost_usd":0.00775,"raw_usage":{"total_tokens":1903,"prompt_tokens":821,"num_sources_used":0,"completion_tokens":96,"cost_in_usd_ticks":77500000,"prompt_tokens_details":{"text_tokens":821,"audio_tokens":0,"image_tokens":0,"cached_tokens":256},"completion_tokens_details":{"audio_tokens":0,"reasoning_tokens":986,"accepted_prediction_tokens":0,"rejected_prediction_tokens":0}},"tokens_in":821,"tokens_out":96,"duration_ms":7153,"temperature":1.0,"reasoning_tokens":986,"cache_read_input_tokens":256,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-07-12T12:32:13.922095+00:00","model_set":{"reader":"grok-4.5"},"falsifier":"Either exhibit, for some α and s, a Pfaffian function of format (α,1,s) whose number of nondegenerate real zeros is o(α^s), or show that every Pfaffian chain of order s on n variables is algebraically dependent over the rational functions, collapsing the lower bound in β.","supporting_citations":[],"review_version":2}