{"id":"95783222-7424-4327-984b-d4358eec57e8","arxiv_id":"2508.15715","paper_version":1,"verdict":"UNVERDICTED","confidence":"LOW","novelty_score":7.0,"correctness_risk":"unknown","formal_verification":"none","parameter_count":0,"one_line_summary":"For 3-pointed genus-zero Gromov-Witten invariants on partial flag varieties, the vanishing decision problem is in AM under GRH.","lead":"This paper proves that deciding whether a genus-zero, 3-pointed Gromov-Witten invariant on a partial flag variety is zero belongs to the complexity class AM, assuming the Generalized Riemann Hypothesis. It builds a bridge between enumerative geometry and computational complexity, potentially allowing such vanishing questions to be certified efficiently.","discovery_kind":"new_method","skeptic_critique":{"model":"deepseek-v4-flash","headline":"Equivalence between GW-vanishing and the constructed polynomial system's solvability is the unproven bridge; without it, AM membership does not follow.","rationale":"The reader correctly identified the weakest assumption as the equivalence between the vanishing of the GW invariant and the solvability/unsolvability of the constructed polynomial system. This is indeed the pivotal unproven step in the abstract. My stress-test concurs: without a rigorous demonstration of that equivalence, the AM-membership result is not established. I also add a size concern (the system must be polynomially bounded in the input) but that is secondary. Since the full text is unavailable, the paper cannot be verified or falsified from the abstract; the reader's UNVERDICTED verdict is appropriate. I recommend no change to that verdict, which is why verdict_should_be is UNCHANGED. The concrete test above would provide initial evidence for or against the equivalence, but a full proof would require inspecting the actual construction.","tokens_in":517,"tokens_out":5594,"duration_ms":66637,"concrete_test":"For a concrete partial flag variety such as Gr(2,5), choose a triple of Schubert classes and a degree d for which the 3-pointed genus-zero GW invariant is known from quantum Schubert calculus to be 0 (resp. positive). Extract the polynomial system from the paper for this instance and test with a computer algebra system whether the system is unsolvable (resp. solvable). Repeat for all d up to 10 for Gr(2,n), n=4..6. A mismatch would refute the claimed equivalence; a match on these examples would support but not fully prove it.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The central claim—that deciding vanishing of a 3-pointed genus-zero GW invariant on a partial flag variety is in AM—rests on an exact translation of that vanishing into the solvability or unsolvability of an explicitly constructed polynomial system. The abstract does not present this translation, and it is not a routine step: GW invariants are defined via moduli of stable maps and virtual fundamental classes, not directly by polynomial equations. For the reduction to be valid, the system must be such that its solution set (with multiplicities, if any) corresponds exactly to the rational curves counted by the invariant, with no spurious solutions from the algebraic encoding, and no dependence on the chosen coordinates or the quantum parameter that could alter the zero/nonzero status. Additionally, the system must have size polynomial in the input length (including the degree, if part of the input) for the AM protocol to run in polynomial time. Since the abstract offers no details of the construction or its correctness proof, the core equivalence is unsupported. If this equivalence fails in either direction, the AM membership conclusion collapses, even if the Parametric Hilbert's Nullstellensatz extension is correct.","agreement_with_reader":"agree"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper claims a complexity-theoretic result: for 3-pointed genus-zero Gromov--Witten invariants on partial flag varieties, the decision problem of whether a given invariant is zero belongs to the Arthur--Merlin class AM, assuming the Generalized Riemann Hypothesis, and hence to the second level of the polynomial hierarchy. The proposed method is to construct an explicit system of polynomial equations from the defining equations of the relevant moduli problem and to apply an extension of the Parametric Hilbert's Nullstellensatz. The supplied manuscript consists of the abstract only; no construction, theorem statements, proofs, or complexity-theoretic definitions are visible.","tokens_in":804,"tokens_out":2866,"duration_ms":34637,"significance":"If the proof is correct, the result is significant: it would give a uniform complexity-theoretic upper bound for vanishing of 3-pointed genus-zero GW invariants on a broad class of varieties, and it would introduce a polynomial-system reduction that could be reusable in enumerative geometry. The claimed extension of the Parametric Hilbert's Nullstellensatz is also potentially valuable in its own right. The manuscript visibly contains no fitted parameters, self-citations, or predictions-from-fits, so the reduction is not circular in the usual sense. However, the significance cannot be fully assessed from the supplied material: the central reduction is asserted rather than demonstrated, and no proof of the Nullstellensatz extension is given.","major_comments":[{"comment":"The paper's main claim depends on an exact translation from the vanishing of a 3-pointed genus-zero GW invariant on a partial flag variety to the solvability or unsolvability of an explicitly constructed polynomial system. The abstract asserts this translation but gives neither the construction nor a correctness statement. In particular, it is not shown how the virtual fundamental class count is encoded by polynomial equations, how multiplicities or spurious solutions are handled, or how the quantum parameter and degree are represented. Without such a correctness lemma, the AM membership conclusion does not follow. This is the load-bearing bridge of the paper and must be stated precisely and proved.","section":"Abstract, Nullstellensatz extension"},{"comment":"The claimed 'extension of the Parametric Hilbert's Nullstellensatz' is referenced only by name. Its hypotheses and conclusion are not stated. If it is used to decide solvability by an AM protocol, one needs explicit bounds on degrees, coefficient heights, and number of variables, or an effective version depending on GRH. Without these, the complexity-theoretic upper bound is not well defined. The abstract leaves open whether the extension is a new theorem or a routine variant, and no proof is supplied.","section":"Abstract, input model"},{"comment":"The complexity statement is ambiguous because the input encoding is not specified. Is the input a description of the partial flag variety, the degree vector, the three insertions, or all of these? What is the size parameter over which the AM bound is polynomial? If the degree is part of the input, the polynomial system must have size polynomial in the input length, including the degree. The abstract does not state this, and without it the membership claim is not formally meaningful.","section":"Abstract"}],"minor_comments":[{"comment":"The phrase '3-pointed, genus zero' should probably be '3-pointed genus-zero' for standard terminology.","section":"Abstract"},{"comment":"The manuscript would benefit from a theorem environment stating the main complexity result and the Nullstellensatz extension separately, so that the two claims are distinguishable.","section":"Abstract"},{"comment":"No references are given; the relationship to prior work on complexity of enumerative problems or to existing effective Nullstellensatz results should be placed.","section":"Abstract"}],"recommendation":"uncertain","confidential_remarks":"The supplied manuscript contains only the abstract, so the proof is not reviewable. The central reduction from GW-invariant vanishing to polynomial-system solvability is the key point, and it is completely unverified. I cannot recommend accept or major revision without the full text; 'uncertain' is the honest verdict. If the full paper is available, I would be happy to review it and then give a definite recommendation."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Quick take: this is a claimed theorem, not a demonstrated one from where I stand—only the abstract is on the table. The idea is genuinely new: reduce 3-pointed genus-zero GW vanishing on partial flag varieties to solvability of an explicit polynomial system, then show the decision problem lands in AM under GRH. If the reduction is exact and the Nullstellensatz extension holds, that's a first complexity-classification for these invariants. Credit where due: they aren't restating an old result; the construction is new and the Parametric Hilbert's Nullstellensatz extension is a useful-sounding tool on its own.\n\nThe soft spot is the one the stress-test note names: the bridge between GW invariants and the polynomial system is exactly where a proof can fail. GW invariants are defined through moduli of stable maps and virtual fundamental classes; they are not visibly polynomial in the input. The abstract gives no hint of how spurious solutions or coordinate choices are controlled, nor whether the system size stays polynomial in the degree when the degree is part of the input. Those are standard necessary conditions for the AM membership claim, and they simply aren't addressed yet. That's not a fatal objection—it's the normal state of an abstract—but it's the place any referee should start.\n\nI can't judge soundness without the full text, and I won't pretend the missing equations are a flaw. The paper deserves a serious referee: the claimed theorem is substantial and the tools are plausible, so a desk rejection would be wrong. The right call is to send it out and put the burden on the authors to show the reduction is exact and the system is polynomial-size.\n\nFor a reading group, this could be a fun one to discuss the strategy, but I wouldn't cite it in my own work until I can see the proof.","headline":"The abstract promises a first complexity-theoretic vanishing criterion for GW invariants, but the central reduction is invisible from the abstract and needs close referee scrutiny.","tokens_in":1147,"tokens_out":1814,"would_cite":false,"duration_ms":21085,"reading_group":"maybe","serious_thinker":"unclear","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["14N35","14M15","68Q17"],"pacs":[],"model":"deepseek-v4-flash","headline":"The paper proves that deciding whether a 3-pointed genus-zero Gromov–Witten invariant on a partial flag variety is zero belongs to the complexity class AM, assuming the Generalized Riemann Hypothesis, and therefore sits in the second level","keywords":["Gromov–Witten invariants","partial flag varieties","vanishing detection","complexity class AM","polynomial hierarchy","Hilbert's Nullstellensatz","Generalized Riemann Hypothesis","enumerative geometry"],"falsifier":"Take a concrete partial flag variety, such as a Grassmannian with low degrees, where the 3-pointed genus-zero Gromov–Witten invariants are known; write down the paper's polynomial system for one such invariant and test whether the system is solvable over the complex numbers. If the system is solvable for an invariant known to vanish, or unsolvable for one known to be nonzero, the central bridge is broken.","tokens_in":511,"feed_emoji":"🧮","tokens_out":6001,"duration_ms":72853,"temperature":0.7,"pith_summary":"This paper asks a concrete computational question: given a Gromov–Witten invariant on a partial flag variety, can one decide whether it is zero? The paper shows that for 3-pointed genus-zero invariants, this decision problem is in the complexity class AM, assuming the Generalized Riemann Hypothesis, and thus lies in the second level of the polynomial hierarchy. The proof works by rewriting the geometric defining equations as an explicit system of polynomial equations, then extending a parametric form of Hilbert's Nullstellensatz to tie solvability of that system to the vanishing of the invariant. A reader should care because this places a natural enumerative-geometry computation into a low complexity class, indicating that such zero-checks are not computationally intractable.","feed_headline":"Zero-check for curve-counting invariants lands in AM","feed_subtitle":"Assuming GRH, this curve-counting zero-check on flag varieties sits in the second level of PH.","key_machinery":"The load-bearing mechanism is a parameterized polynomial system constructed from the defining equations of the invariant, together with an extension of Parametric Hilbert's Nullstellensatz. The extension guarantees that solvability of that system is equivalent to the vanishing of the invariant, converting a geometric question into an algebraic feasibility question of the kind AM is designed to handle. Hilbert's Nullstellensatz, in its classical form, says a system of polynomial equations over an algebraically closed field has a solution unless 1 belongs to the ideal it generates; the paper's parametric extension adapts this to the family of systems arising from the Gromov–Witten invariants.","core_discovery":"The paper establishes that the vanishing problem for 3-pointed genus-zero Gromov–Witten invariants on partial flag varieties has an Arthur–Merlin protocol: assuming GRH, a probabilistic polynomial-time verifier can be convinced that the invariant is zero or nonzero with a short proof. This places the problem in AM and hence in the second level of the polynomial hierarchy. The route is constructive: for each such invariant, the paper builds an explicit finite system of polynomial equations obtained by translating the defining equations, and proves an extension of the Parametric Hilbert Nullstellensatz that reduces the invariant's vanishing to the solvability of that system. The reduction is u","pith_inferences":["The same translation from defining equations to polynomial systems may extend to higher genus or more marked points, which would broaden the complexity classification beyond the 3-pointed genus-zero case.","The AM protocol suggests that vanishing of Gromov–Witten invariants could be certified for large examples, offering a way to check conjectural enumerative data without fully computing the invariants.","The reduction provides a concrete search strategy for a counterexample: for a small partial flag variety with a known invariant, solve the constructed polynomial system numerically and compare its solvability with the known zero/nonzero status.","If the technique generalizes to other homogeneous varieties, the boundary between computationally easy and hard curve-counting decisions may align with the existence of such parameterized defining equations."],"forward_implications":["If the proof is correct, deciding vanishing of 3-pointed genus-zero Gromov–Witten invariants on partial flag varieties is in AM (assuming GRH), placing it in the second level of the polynomial hierarchy.","The explicit polynomial system gives a uniform, algorithmic route for testing such invariants, rather than requiring a different argument for each partial flag variety.","The extension of Parametric Hilbert's Nullstellensatz is a standalone algebraic tool that could apply to other zero-testing problems in algebraic geometry.","Under GRH, the result effectively rules out the possibility that this geometric zero-check is as hard as an arbitrary polynomial-system feasibility problem.","Removing the GRH assumption would be the next milestone: the current theorem is conditional, and an unconditional proof would strengthen the complexity classification."],"supporting_citations":[],"fun_headline_variants":["Vanishing of GW invariants on flag varieties lands in AM","Short proofs for zero Gromov–Witten invariants on flag varieties","GRH puts GW zero-check on flag varieties in AM","Zero Gromov–Witten invariants on flag varieties verifiable in AM","3-pointed genus-zero GW vanishing is in AM under GRH"],"cache_read_input_tokens":2688,"weakest_assumption_plain":"The result rests on the claim that the polynomial system built from the defining equations exactly captures the vanishing of the invariant; if that equivalence is even slightly off, the AM membership conclusion does not follow.","fun_headline_variants_meta":{"raw":{"variants":["Vanishing of GW invariants on flag varieties lands in AM","Short proofs for zero Gromov–Witten invariants on flag varieties","GRH puts GW zero-check on flag varieties in AM","Zero Gromov–Witten invariants on flag varieties verifiable in AM","3-pointed genus-zero GW vanishing is in AM under GRH"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000684,"raw_usage":{"total_tokens":2873,"prompt_tokens":612,"completion_tokens":2261,"prompt_tokens_details":{"cached_tokens":256},"prompt_cache_hit_tokens":256,"prompt_cache_miss_tokens":356,"completion_tokens_details":{"reasoning_tokens":2168}},"tokens_in":356,"tokens_out":2261,"duration_ms":17356,"temperature":1.0,"reasoning_tokens":2168,"cache_read_input_tokens":256,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-05T17:41:51.163882+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Take a concrete partial flag variety, such as a Grassmannian with low degrees, where the 3-pointed genus-zero Gromov–Witten invariants are known; write down the paper's polynomial system for one such invariant and test whether the system is solvable over the complex numbers. If the system is solvable for an invariant known to vanish, or unsolvable for one known to be nonzero, the central bridge is broken.","supporting_citations":[],"review_version":1}