{"id":"7a473af9-830b-4ec1-ad3e-c4977b24b4fe","arxiv_id":"2509.00165","paper_version":1,"verdict":"CONDITIONAL","confidence":"MODERATE","novelty_score":6.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":0,"one_line_summary":"A Grassmannian and oriented matroid sign-completion algorithm proves three n=4 Lotka-Volterra interaction networks admit no feasible-stable coexistence.","lead":"This paper recasts the question of which species-interaction networks allow stable coexistence in the Lotka-Volterra model as a sign-pattern problem on a Grassmannian, and uses an algebraic search to prove that several four-species networks are impossible. It matters because it turns numerical ecological conjectures into exact, computer-checkable algebra.","discovery_kind":"new_method","skeptic_critique":{"model":"deepseek-v4-flash","headline":"Theorem 5.1's impossibility result rests on an unverified exhaustive Maple search with no certificate, pinned code, or independent check; the central claim is not yet reproducible.","rationale":"I read the paper in good faith. The Grassmannian encoding, the semialgebraic formulation, and the worked n=3 examples are interesting and largely convincing. The n=3 impossibility arguments (Example 5.2) are supported by hand-verifiable computations, and Section 6 is explicitly exploratory. The new substantial claim is Theorem 5.1 for n=4, and its proof is entirely delegated to the Maple search. The reader's weakest-assumption analysis correctly targets the completeness and correctness of that search. My stress-test did not find a separate mathematical gap that would make the theorem false; the issue is evidential. The paper states the code is available, but no certificate or reproducible log accompanies the claimed exhaustion, and the implementation explicitly omits higher-order Hurwitz constraints. That omission is logically harmless for an impossibility proof if and only if the remaining search is truly exhaustive and each pruning step is sound. Because the constraints involve sums of signed terms, sign-level pruning requires justification that is not supplied. Therefore the correct disposition is the same as the reader's: conditional acceptance, contingent on a reproducible certificate or an independent verification for the three n=4 patterns. No verdict change is needed from the reader's conditional recommendation.","tokens_in":17404,"tokens_out":8311,"duration_ms":119220,"concrete_test":"Pin the GitLab repository [25] to a specific commit and add a certificate/tracing mode that, for each of the three n=4 sign patterns in Theorem 5.1, outputs the complete search tree: every branch assignment, every Grassmann–Plücker inference used, and every inequality-based prune. Write an independent verifier that checks each inference against the 3-term relations (19) and each prune against a valid necessary condition (e.g., an all-terms-opposite-sign contradiction in (12) or (16)). Run the verifier; if it confirms that all branches are closed and every closure step is valid, Theorem 5.1 is supported. As a second, independent check, use a certified real decision procedure (e.g., CAD or an interval branch-and-bound with rigorous exclusion) on the same sign patterns to confirm emptiness of the feasible-stable semialgebraic set.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The central claim, Theorem 5.1, is proved by the sentence: 'Our computational check ... exhaustively searched for such completions and finds none in each of the three cases.' The load-bearing premise is that the Maple implementation's Propagation–Branching procedure (Section 4) is both sound and complete for the constraints it uses: every branch that is pruned is genuinely contradictory, and every surviving leaf is examined. The paper supplies neither a proof of completeness/correctness for Algorithm 1 nor a certificate, commit-hash-pinned code, or search log for the three n=4 patterns. This matters because the constraints (12) and (16) are sums of signed monomials: a sign assignment alone usually cannot decide whether such a sum is positive. If the code prunes based on an unsound sign-level check, or if a Grassmann–Plücker propagation step is misimplemented, 'no valid completion found' would not imply 'no feasible-stable equilibrium exists.' The explicit omission of higher-order Hurwitz positivity (Section 4: 'our current implementation does not incorporate the higher-order positivity conditions imposed by the Hurwitz polynomials') is safe for impossibility only because using a relaxation enlarges the search space; but this makes the exhaustiveness requirement even more critical, since the search must cover every sign vector satisfying the weaker necessary conditions. Without an independently checkable record of the exhaustion, Theorem 5.1 is a computational assertion rather than a verified mathematical theorem.","agreement_with_reader":"agree"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper studies stable feasible equilibria of the Lotka–Volterra system from the viewpoint of algebraic geometry. It encodes the parameters (a,B) in an n x 2n matrix M = [diag(a) | B] and maps it to the real Grassmannian Gr(n,2n), expressing feasibility and stability as sign constraints on Plücker coordinates via the Routh–Hurwitz criterion and the Grassmann–Plücker relations. The authors formulate a combinatorial relaxation of the realizability problem for sign patterns, then describe a Propagation–Branching algorithm implemented in Maple. The central result, Theorem 5.1, claims that three n=4 ecological sign patterns are impossible, i.e., admit no feasible, locally asymptotically stable coexistence equilibrium. A final section uses HypersurfaceRegions.jl to decompose parameter space for n=2,3 and to find sample points for rare irreducible ecologies for n=3 and one n=4 case.","tokens_in":17689,"tokens_out":4926,"duration_ms":62954,"significance":"If the main theorem is made fully verifiable, the paper would be a valuable contribution: it replaces numerical conjectures from [20] with exact impossibility statements for small ecological networks and introduces a Grassmannian/oriented-matroid framework that may be reusable for other sign-pattern realizability problems. The algebraic reformulation is natural, and the n=2 and n=3 checks reproduce known classifications, which lends internal credibility. However, the decisive n=4 result currently rests on an unshipped exhaustive computer search. No machine-checked certificate, pinned code, or search log is provided, and Section 4 explicitly notes that higher-order Hurwitz positivity is not incorporated. The paper also honestly reports in Example 5.2 that for n=3 the raw algorithm returned a completion that had to be ruled out by additional manual inequalities involving smaller minors. These facts make it impossible for a reader to independently verify the central claim as it stands, so the significance of Theorem 5.1 is presently conditional on the availability of reproducible computational evidence.","major_comments":[{"comment":"The proof of Theorem 5.1 rests entirely on the sentence: 'Our computational check ... exhaustively searched for such completions and finds none in each of the three cases.' The Maple implementation is referenced as [25], but no commit hash, search log, certificate, or independently checkable trace is supplied, and Algorithm 1 is not accompanied by a correctness/completeness theorem. Since the claim is a universal impossibility statement, the exhaustiveness claim must be auditable. Please provide pinned code with a versioned repository, a machine-readable log of all branches explored and pruned, or an independent SAT/CP/SMT certificate that can be checked without rerunning the original implementation.","section":"Theorem 5.1 and Section 4"},{"comment":"The text states that 'our current implementation does not incorporate the higher-order positivity conditions imposed by the Hurwitz polynomials.' This omission is safe for an impossibility proof only if the search is exhaustive over a superset of the true feasible set. But the manuscript does not state precisely which polynomials from (16) and which Hurwitz determinants are actually checked at the leaves, nor does it prove that the implemented Propagation–Branching procedure enumerates every sign vector satisfying the stated necessary conditions. The reader therefore cannot distinguish 'no completion under the implemented necessary conditions' from 'no completion under the full stability conditions.' Please list the exact inequality set used, state explicitly that all omitted conditions are relaxations, and supply a certificate of exhaustion for the three cases.","section":"Section 4, paragraph after Eq. (16)"},{"comment":"Algorithm 1 says 'Try to infer chi(B_u) by solving G-P relation' without specifying the inference rule. The Grassmann–Plücker relation (19) is an implication with sign preconditions; an unsound inference step could prune realizable completions, while an incomplete step could miss forced signs and leave the exhaustion claim unsupported. Theorem 4.2 proves only termination, not that every full sign assignment consistent with (12), (16), and (19) survives to a leaf. A formal soundness and completeness statement for the propagation rule is needed, together with a proof that the branching loop explores all remaining sign assignments whenever propagation terminates.","section":"Algorithm 1, Step 3 (Sign Inference)"},{"comment":"Example 5.2 shows that the implementation alone did not certify the n=3 impossible ecologies: for two of the four n=3 cases the algorithm returned a unique valid completion, and the contradiction was only obtained by an additional hand-written analysis using smaller-minor signs. This is an honest limitation statement, but it also demonstrates that the code's notion of 'valid completion' is weaker than true feasibility-stability. The same caveat therefore applies to the n=4 claim in Theorem 5.1, where no analogous manual certificate or secondary check is provided. Please either prove that the n=4 search is exhaustive modulo the weaker constraints, or supply independent confirmation that the three sign patterns have no feasible-stable point (e.g., by interval arithmetic, CAD, or a verified satisfiability solver).","section":"Example 5.2 and Section 5"}],"minor_comments":[{"comment":"'These conditions stratifies the parameter space' should be 'stratify'.","section":"Abstract"},{"comment":"In the sentence 'a Lotka–Volterra network with sign pattern sigma is called impossible if and only if its feasible-stable stratum is empty, SN(sigma) = empty', the notation SN(sigma) should be S_n(sigma) for consistency.","section":"Definition 2.3"},{"comment":"The text says [20] classifies impossible ecologies 'for n < 3' but then discusses n=3 cases; this should be n <= 3 or 'for n <= 3'.","section":"Section 5, paragraph after Theorem 5.1"},{"comment":"The repository URL is given without a version identifier or retrieval date. If a revised version is uploaded, please include the commit hash and archival DOI or date of access.","section":"Reference [25]"},{"comment":"The boxed region highlighting the three proved impossible patterns is not visible in the text; the caption or figure should clearly mark which symmetric patterns are covered by Theorem 5.1 as opposed to conjectured impossible in [20].","section":"Figure 2"},{"comment":"Typo: 'prerint' should be 'preprint'.","section":"Reference [10]"}],"recommendation":"major_revision","confidential_remarks":"The central mathematical framework is promising, but Theorem 5.1 is a computational theorem whose evidence is not yet reproducible. I would recommend making the acceptance conditional on the authors depositing a versioned, executable copy of the Maple code, a full search log or certificate for the three n=4 cases, and an explicit statement of the exact polynomial inequalities checked. If the journal does not normally accept computational proofs without certificates, this point should be treated as a hard requirement rather than a suggestion. The paper's self-reported limitations in Section 4 and Example 5.2 are commendable, but they also underscore that the present manuscript does not yet meet that bar."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Hi [Colleague],\n\nQuick take on arXiv:2509.00165. The Grassmannian reformulation is genuinely neat and the n=3 results reproduce known impossibilities, but the headline n=4 theorem is a computational assertion with no certificate behind it. I would not cite the theorem as proven, though the framework is worth a look.\n\nWhat's new: they encode feasibility and stability of Lotka-Volterra equilibria as sign conditions on Plücker coordinates of Gr(n,2n), using oriented matroid theory to propagate constraints. Theorem 3.1 and Corollary 3.3 give a clean semialgebraic-to-combinatorial pipeline, and Algorithm 1 (propagation + branching) is a reasonable way to explore sign completions. The n=3 examples are worked out carefully, including the subtle case where a completion passes all used constraints but is killed by smaller-minor signs (Example 5.2). That shows the authors understand the limitations of their constraint set. The HypersurfaceRegions.jl computations in Section 6 add some empirical value, though they're exploratory.\n\nThe soft spot is exactly where the reader's report puts it: Theorem 5.1 is proven by the sentence 'Our computational check ... exhaustively searched ... and finds none.' No certificate, no pinned code, no search log. The repository is referenced but not evaluated. Termination (Theorem 4.2) is trivial; it doesn't establish completeness or correctness of the propagation. The checks in (12) and (16) are sums of signed monomials, and it's not clear how the algorithm evaluates them on partial sign assignments without doing exact arithmetic. If the pruning is based on sign-level reasoning alone, it could prune real completions and produce a false impossibility. The omission of higher-order Hurwitz conditions is safe for an impossibility claim (a relaxation can't create false negatives), but that makes the exhaustiveness requirement even more load-bearing.\n\nSo the paper deserves a serious referee, but the referee should ask to see the actual search output or a certificate, and ideally a proof that the propagation is complete for the relations used. As it stands, the central result is conditional on a black-box Maple run.\n\nMy call: send to peer review, but flag the reproducibility issue as the gating concern. I'd bring it to a reading group to discuss the Grassmannian encoding, but I wouldn't put the theorem in a paper without independent verification.","headline":"Nice Grassmannian framework; the n=4 impossibility theorem is a computational black box with no certificate.","tokens_in":18190,"tokens_out":2673,"would_cite":false,"duration_ms":29500,"reading_group":"maybe","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["14M15","14P10","92D25","05B35"],"pacs":[],"model":"deepseek-v4-flash","headline":"The paper proves that three four-species interaction networks in the Lotka–Volterra model are impossible ecologies: no choice of growth rates and interaction strengths with the prescribed signs yields a positive, locally asymptotically stab","keywords":["Lotka–Volterra","feasible-stable stratum","Grassmannian","Plücker coordinates","oriented matroids","sign patterns","impossible ecologies","Routh–Hurwitz"],"falsifier":"For any one of the three boxed n=4 sign patterns, exhibit explicit numbers a and B with those signs such that adj(B)a > 0 and all Hurwitz determinants of -diag(adj(B)a)B are positive. If such a parameter pair exists, Theorem 5.1 is false; alternatively, an independent reimplementation of the sign-completion search that returns a valid completion for one of these patterns would also falsify the claim.","tokens_in":17302,"feed_emoji":"🕸️","tokens_out":5343,"duration_ms":59224,"temperature":0.7,"pith_summary":"This paper makes the study of which small ecological interaction networks allow stable coexistence exact rather than statistical. It translates coexistence—a feasible, locally asymptotically stable equilibrium of the Lotka–Volterra system—into polynomial inequalities and then into sign constraints on the Plücker coordinates of a real Grassmannian. A branch-and-propagate algorithm, driven by Grassmann–Plücker relations and oriented matroids, decides whether a prescribed sign pattern of growth rates and interactions admits any consistent extension. The main payoff is Theorem 5.1: three four-species networks previously conjectured to be impossible are now proved impossible. The same framework also returns a combinatorial stratification of possible cases and is complemented by numerical decompositions of parameter space.","feed_headline":"Three four-species networks are impossible ecologies","feed_subtitle":"A Plücker sign search upgrades numerical conjectures for n=4 to proof.","key_machinery":"The central object is the real Grassmannian Gr_R(n,2n), entered through the Plücker coordinates of the n×2n parameter matrix [diag(a)|B]. Feasibility becomes linear inequalities in these Plücker coordinates; stability becomes positivity conditions on characteristic-polynomial coefficients and Hurwitz determinants; the oriented Grassmann–Plücker relations are quadratic sign-propagation rules among maximal minors. The algorithm alternates propagation, which applies these relations to infer unknown signs, with branching on remaining unknowns, pruning branches that fail feasibility or stability checks.","core_discovery":"The central claim is that feasibility and local asymptotic stability of a Lotka–Volterra equilibrium can be encoded as sign constraints on the maximal minors of the matrix [diag(a) | B], i.e. as signs of Plücker coordinates of a point in Gr_R(n,2n). Using Grassmann–Plücker relations to propagate signs and branching with feasibility and stability checks to prune, the authors develop an exhaustive search for completions of a partial sign assignment. Theorem 5.1 states that for the three four-species networks in the boxed region of Figure 2, no valid completion exists, so these networks are impossible ecologies. This upgrades numerical conjectures from prior work to proven statements. For n=3,","pith_inferences":["If the exhaustiveness of the search is accepted, the same machinery could be extended to the remaining n=4 symmetric conjectures by adding smaller-minor and higher-order Hurwitz constraints, and eventually to the unresolved n=5 cases from prior work.","The large gap in completion counts between symmetric and asymmetric networks suggests a group-theoretic explanation of how symmetry constrains realizable chirotopes; such a principle could predict impossible ecologies before running the search.","The observation that sign patterns alone do not determine feasibility or stability implies that the oriented-matroid stratum is strictly coarser than the semialgebraic stratum; characterizing which completions actually lift to real parameters (a,B) would sharpen the method into a full realization criterion."],"forward_implications":["The three four-species impossible ecologies of Theorem 5.1 are settled: no parameter choice with those signs can yield stable coexistence, so further search for feasible-stable equilibria in those networks is guaranteed to fail.","For n=3, the method reproduces all four impossible ecologies and pinpoints the exact constraint that rules out the two asymmetric cases, completing a symbolic account of the n=3 classification.","The feasible-stable parameter space is stratified by sign patterns and oriented-matroid types, so the number of valid sign completions provides a combinatorial measure of how constrained coexistence is for a given interaction network.","The combination of symbolic sign-completion with numerical region decomposition can detect rare feasible-stable ecologies that random sampling misses, as shown by realizing all six n=3 irreducible ecologies and one low-probability n=4 ecology.","The chirotope rule alone sharply restricts symmetric interaction structures: symmetric n=4 patterns yield far fewer completions than asymmetric ones, indicating that graph symmetry imposes combinatorial obstructions to coexistence."],"supporting_citations":[{"why":"Supplies the impossible-ecology conjectures for n=4 and the classification for n=3 that this paper upgrades, reproduces, or refines.","marker":"[20]"},{"why":"Provides the oriented matroid and chirotope formalism used to express the Grassmann–Plücker sign constraints.","marker":"[5]"},{"why":"Supplies the Grassmannian and Plücker embedding background used to re-encode parameters as vectors of maximal minors.","marker":"[21]"},{"why":"Gives the Lotka–Volterra setup and the Routh–Hurwitz stability criterion underlying the semialgebraic formulation.","marker":"[23]"},{"why":"Hosts the implementation of the branch-and-propagate search whose assumed exhaustiveness carries Theorem 5.1.","marker":"[25]"},{"why":"Provides the numerical hypersurface-region decomposition used to count feasible-stable regions and detect rare sign patterns.","marker":"[7]"}],"fun_headline_variants":["Four-species networks proven impossible via Plücker signs","Grassmannian geometry rules out three ecologies","Plücker relations certify impossible Lotka-Volterra networks","Algebraic geometry settles rare coexistence patterns"],"cache_read_input_tokens":2688,"weakest_assumption_plain":"The argument collapses if the computational search, as implemented, was not exhaustive—if some sign completion satisfying the Grassmann–Plücker relations and the feasibility and stability checks was missed, the 'no completion' conclusion for the three n=4 patterns would not follow.","fun_headline_variants_meta":{"raw":{"variants":["Four-species networks proven impossible via Plücker signs","Grassmannian geometry rules out three ecologies","Plücker relations certify impossible Lotka-Volterra networks","Algebraic geometry settles rare coexistence patterns"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000235,"raw_usage":{"total_tokens":1326,"prompt_tokens":719,"completion_tokens":607,"prompt_tokens_details":{"cached_tokens":256},"prompt_cache_hit_tokens":256,"prompt_cache_miss_tokens":463,"completion_tokens_details":{"reasoning_tokens":544}},"tokens_in":463,"tokens_out":607,"duration_ms":6566,"temperature":1.0,"reasoning_tokens":544,"cache_read_input_tokens":256,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-05T13:52:45.028839+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"For any one of the three boxed n=4 sign patterns, exhibit explicit numbers a and B with those signs such that adj(B)a > 0 and all Hurwitz determinants of -diag(adj(B)a)B are positive. If such a parameter pair exists, Theorem 5.1 is false; alternatively, an independent reimplementation of the sign-completion search that returns a valid completion for one of these patterns would also falsify the claim.","supporting_citations":[{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Supplies the impossible-ecology conjectures for n=4 and the classification for n=3 that this paper upgrades, reproduces, or refines."},{"cited_title":"Bj¨ orner, M","cited_arxiv_id":null,"evidence_quote":"Provides the oriented matroid and chirotope formalism used to express the Grassmann–Plücker sign constraints."},{"cited_title":"Micha lek and B","cited_arxiv_id":null,"evidence_quote":"Supplies the Grassmannian and Plücker embedding background used to re-encode parameters as vectors of maximal minors."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Gives the Lotka–Volterra setup and the Routh–Hurwitz stability criterion underlying the semialgebraic formulation."},{"cited_title":"Scholten, K","cited_arxiv_id":null,"evidence_quote":"Hosts the implementation of the branch-and-propagate search whose assumed exhaustiveness carries Theorem 5.1."},{"cited_title":"Breiding, B","cited_arxiv_id":null,"evidence_quote":"Provides the numerical hypersurface-region decomposition used to count feasible-stable regions and detect rare sign patterns."}],"review_version":1}