Pith. sign in

REVIEW 4 major objections 6 minor 27 references

Strata of Ecological Coexistence via Grassmannians

T0 review · 4 major / 6 minor · reviewed 2026-08-05 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read 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

desk verdict Nice Grassmannian framework; the n=4 impossibility theorem is a computational black box with no certificate. read the letter →

arxiv 2509.00165 v1 pith:OCGSSVMN submitted 2025-08-29 math.AG

Türkü Özlüm Çelik , Pierre A. Haas , Georgy Scholten , Kexin Wang , Giulio Zucal This is my paper · ORCID
classification math.AG MSC 14M1514P1092D2505B35
keywords Lotka–Volterrafeasible-stablestratumGrassmannianPlückercoordinatesorientedmatroidssignpatternsimpossibleecologiesRouth–Hurwitz
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

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.

What carries the argument

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.

What would settle it

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.

Watch

Extended reading notes

Core claim

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,

Load-bearing premise

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.

Editorial extensions

If this is right

  • 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.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • 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.
Share X Bluesky LinkedIn Reddit HN

Signed reviews

No signed human review yet.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

4 major / 6 minor

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.

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 (4)
  1. [Theorem 5.1 and Section 4] 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.
  2. [Section 4, paragraph after Eq. (16)] 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.
  3. [Algorithm 1, Step 3 (Sign Inference)] 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.
  4. [Example 5.2 and Section 5] 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).
minor comments (6)
  1. [Abstract] 'These conditions stratifies the parameter space' should be 'stratify'.
  2. [Definition 2.3] 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.
  3. [Section 5, paragraph after Theorem 5.1] 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'.
  4. [Reference [25]] 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.
  5. [Figure 2] 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].
  6. [Reference [10]] Typo: 'prerint' should be 'preprint'.

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity: the Grassmannian reformulation is a genuine equivalence, and the impossibility theorem rests on an exhaustive computation whose unverified status is a reproducibility concern, not a circular step.

full rationale

The paper's central derivation chain is self-contained rather than circular. Theorem 3.1 establishes an if-and-only-if between existence of a feasible-stable point (a,B) in S_n(σ) and existence of a Plücker point p with sign-compatible coordinates satisfying feasibility (12), stability (16), and Grassmann–Plücker relations (19). The converse constructs (a,B) from p by row-scaling a canonical matrix representative, so the Plücker conditions are not defined in terms of the target feasibility-stability property; they are an equivalent encoding. Corollary 3.3 only uses these as necessary conditions, which is logically safe. Theorem 5.1's impossibility claim for the three n=4 networks is proved by the sentence: "Our computational check, using the two-pronged algorithm described in Section 4, exhaustively searched for such completions and finds none in each of the three cases, certifying that the feasible-stable set is empty." This is a computational exhaustive search over a relaxation, not a fitted parameter renamed as a prediction. The paper itself notes: "our current implementation does not incorporate the higher-order positivity conditions imposed by the Hurwitz polynomials introduced in (7)"; omitting constraints enlarges the search space, so this omission cannot manufacture false impossibilities. The absence of a certificate, commit-pinned code, or independent search log makes the exhaustiveness assertion unverified, but that is a correctness/reproducibility risk, not a circularity defect. Self-citations to [20] (coauthored by Haas), to the Maple repository [25], and to HypersurfaceRegions.jl [7] (coauthored by Wang) are present, but they are used as sources of conjectures, benchmarks, and software tools; none of the cited results is assumed as input to Theorem 5.1. No equation is shown to equal its own input by construction, and no fitted quantity is relabeled as a prediction. The derivation therefore has no significant circularity.

Assumptions & free parameters 0 free parameters · 6 assumptions · 0 invented entities

The central proof uses no fitted constants: numerical choices such as bii=1 and x*=(1,...,1) are normalizations in Section 6, not free parameters fit to data. The load-bearing assumptions are classical stability criteria, a standard necessary-condition arithmetic for Plucker signs, and an unverified computational exhaustion for the n=4 theorem.

assumptions (6)
  • standard math Routh-Hurwitz criterion: all eigenvalues of a matrix have negative real part iff all Hurwitz polynomials are positive.
    Invoked in Theorem 2.1 and Definition 2.2 to convert Jacobian stability to polynomial positivity conditions.
  • standard math For nonsingular B, the Lotka-Volterra system has a unique steady state x* = B^{-1}a, and feasibility is adj(B)a > 0 when det(B) > 0.
    Used in Equations (3) and (5) as the starting point for the semialgebraic formulation.
  • standard math The 3-term Grassmann-Plucker relations are necessary conditions for a sign pattern of Plucker coordinates to come from a realizable oriented matroid.
    Used in Equation (19) and Corollary 3.3 to restrict the sign-completion search. Sufficiency is not needed for impossibility.
  • domain assumption Positive diagonal scaling B -> BD with D diagonal positive preserves feasibility and stability, so setting bii = 1 is without loss of generality.
    Invoked in Section 6 before the HypersurfaceRegions computations; requires the ecological convention bii > 0.
  • domain assumption Fixing x* = (1,...,1) is a valid way to search for existence of feasible-stable equilibria.
    Used in Section 6 for numerical region decomposition. This is a normalization for searching instances, not a proof of completeness over all parameter space.
  • ad hoc to paper The Maple branch-and-propagation search is exhaustive and correctly implements the sign-completion rules.
    The proof of Theorem 5.1 says 'Our computational check... exhaustively searched... finds none', but the paper provides no machine-checkable certificate or pinned code artifact for this exhaustion.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Strata of Ecological Coexistence via Grassmannians." pith.science (2026). https://pith.science/paper/OCGSSVMN

@misc{pith2026250900165,
  author       = {Pith},
  title        = {Pith review of: Strata of Ecological Coexistence via Grassmannians},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/OCGSSVMN}},
  note         = {Machine review of arXiv:2509.00165}
}
abstract

We study the Lotka--Volterra system from the perspective of computational algebraic geometry, focusing on equilibria that are both feasible and stable. These conditions stratifies the parameter space in $\mathbb{R}\times\mathbb{R}^{n\times n}$ with the feasible-stable semialgebraic sets. We encode them on the real Grassmannian ${\rm Gr}_{\mathbb{R}}(n,2n)$ via a parameter matrix representation, and use oriented matroid theory to develop an algorithm, combining Grassmann--Pl{\"u}cker relations with branching under feasibility and stability constraints. This symbolic approach determines whether a given sign pattern in the parameter space $\mathbb{R}\times\mathbb{R}^{n\times n}$ admits a consistent extension to Pl{\"u}cker coordinates. As an application, we establish the impossibility of certain interaction networks, showing that the corresponding patterns admit no such extension satisfying feasibility and stability conditions, through an effective implementation. We complement these results using numerical nonlinear algebra with \texttt{HypersurfaceRegions.jl} to decompose the parameter space and detect rare feasible-stable sign patterns.

Figures

Figures reproduced from arXiv: 2509.00165 by the authors.

Figure 1
Figure 1. Lotka–Volterra ecological dynamics on a network of n = 5 species: definition of the different types of ecological interactions. Figure redrawn from [20]. 14 [PITH_FULL_IMAGE:figures/full_fig_p014_1.png] view at source ↗
Figure 2
Figure 2. Ecological patterns of n = 4 species conjectured to be impossible in [20]. The ecological patterns in the first row are symmetric; those in the second row are asymmet￾ric. Our computations establish that the symmetric patterns contained in the box are impossible. them to have no valid sign completions, i.e., to be impossible. For the remaining two (asymmetric) configurations, the algorithm returns a single completio… view at source ↗

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

27 extracted references · 27 canonical work pages

  1. [20]

    Y. Meng, S. Horv´ at, C. D. Modes, and P. A. Haas. Impossible ecologies: Interac- tion networks and stability of coexistence in ecological communities. Cell Systems , 16(7):101297, 2025. 1, 2, 3, 4, 5, 14, 15, 16, 17, 18

    work page 2025

  2. [25]

    Scholten, K

    G. Scholten, K. Wang, and G. Zucal. Feasible-stable ecologies. https://git. mpi-cbg.de/scholten/feasible-stable-ecologies , 2025. GitLab repository. 3, 12

    work page 2025

  3. [1]

    H. Abo, I. Portakal, and L. Sodomaco. A vector bundle approach to Nash equilibria. preprint arXiv:2504.03456, 2025. 6

    work page arXiv 2025

  4. [2]

    L. J. S. Allen. An Introduction to Mathematical Biology . Pearson/Prentice Hall,

    work page

  5. [3]

    Allesina and S

    S. Allesina and S. Tang. Stability criteria for complex ecosystems. Nature, 483:205– 208, 2012. 2

    work page 2012

  6. [4]

    Allesina and S

    S. Allesina and S. Tang. The stability-complexity relationship at age 40: a random matrix perspective. Pop. Ecol., 57:63–75, 2015. 2

    work page 2015

  7. [5]

    Bj¨ orner, M

    A. Bj¨ orner, M. Las Vergnas, B. Sturmfels, N. White, and G. M. Ziegler. Oriented matroids, volume 46 of Encyclopedia of Mathematics and its Applications. Cambridge University Press, Cambridge, second edition, 1999. 3

    work page 1999

  8. [6]

    Bogoyavlensky

    O.I. Bogoyavlensky. Integrable discretizations of the KdV equation. Physics Letters A, 134(1):34–38, 1988. 6

    work page 1988

Show all 27 references
  1. [7]

    Breiding, B

    P. Breiding, B. Sturmfels, and K. Wang. Computing arrangements of hypersurfaces. Journal of Software for Algebra and Geometry , 15(1):11–27, 2025. 16

    2025

  2. [8]

    Butler and J

    S. Butler and J. P. O’Dwyer. Stability criteria for complex microbial communities. Nature Communications, 9:2970, 2018. 2

    2018

  3. [9]

    K. Z. Coyte, J. Schluter, and K. R. Foster. The ecology of the microbiome: Networks, competition, and stability. Science, 350(6261):663–666, 2015. 2

    2015

  4. [10]

    Cummings, K

    J. Cummings, K. J.-M. Dahlin, E. Gross, and J. D. Hauenstein. Routing functions for parameter space decomposition to describe stability landscapes of ecological models. prerint arXiv:2505.00128, 2025. 16

    2025 arXiv

  5. [11]

    Cummings, J

    J. Cummings, J. D. Hauenstein, H. Hong, and C. D. Smyth. Smooth connectivity in real algebraic varieties. Numerical Algorithms, pages 1–22, 2024. 16

    2024

  6. [12]

    Curto and K

    C. Curto and K. Morrison. Graph rules for recurrent neural network dynamics. Notices of the American Mathematical Society , 70(4):536–551, 2023. 19 19

    2023

  7. [13]

    Dickenstein

    A. Dickenstein. Biochemical reaction networks: an invitation for algebraic geometers. In Mathematical Congress of the Americas , volume 656 of Contemporary Mathemat- ics, pages 65–83. Amer. Math. Soc., Providence, RI, 2016. 6

    2016

  8. [14]

    A. W. M. Dress and W. Wenzel. Valuated matroids. Advances in Mathematics , 93(2):214–250, 1992. 8

    1992

  9. [15]

    A. T. Fuller. Conditions for a matrix to have only characteristic roots with negative real parts. Journal of Mathematical Analysis and Applications , 23(1):71–98, 1968. 4

    1968

  10. [16]

    Gesmundo and H

    F. Gesmundo and H. Keneshlou. Collineation varieties of tensors. Collectanea Math- ematica, 2025. 10

    2025

  11. [17]

    I. A. Hatton, O. Mazzarisi, A. Altieri, and M. Smerlak. Diversity begets sta- bility: Sublinear growth and competitive coexistence across ecosystems. Science, 383(6688):eadg8488, 2024. 2

    2024

  12. [18]

    Hofbauer and K

    J. Hofbauer and K. Sigmund. Evolutionary Games and Population Dynamics . Cam- bridge University Press, Cambridge, 1998. 1, 2, 5

    1998

  13. [19]

    R. M. May. Will a large complex system be stable? Nature, 238:413–414, 1972. 2

    1972

  14. [21]

    Micha lek and B

    M. Micha lek and B. Sturmfels. Invitation to Nonlinear Algebra, volume 211 of Grad- uate Studies in Mathematics . American Mathematical Society, Providence, RI, 2021. 2, 6

    2021

  15. [22]

    Mougi and M

    A. Mougi and M. Kondoh. Diversity of interaction types and ecological community stability. Science, 337(6092):349–351, 2012. 2

    2012

  16. [23]

    J. D. Murray. Mathematical Biology , volume I. Springer, Berlin, Germany, 3rd edition, 2002. 1, 2, 4

    2002

  17. [24]

    A. Roberts. The stability of a feasible random ecosystem. Nature, 251(5476):607–608,

  18. [26]

    J. Wei, X. Geng, and X. Zeng. The Riemann theta function solutions for the hierar- chy of Bogoyavlensky lattices. Transactions of the American Mathematical Society , 371(2):1483–1507, 2019. 6

    2019

  19. [27]

    E. C. Zeeman. Population dynamics from game theory. In Zbigniew Nitecki and Clark Robinson, editors, Global Theory of Dynamical Systems, pages 471–497, Berlin, Heidelberg, 1980. Springer Berlin Heidelberg. 5 20 Authors’ addresses: T¨ urk¨ u¨Ozl¨ um C ¸ elik, Max Planck Institu...

    1980

Pith tools

Reviewed August 5, 2026 · model on record in the stance chip above.