{"id":"ad4783e6-590e-4582-a448-7a6fa0c43f89","arxiv_id":"2411.18264","paper_version":4,"verdict":"CONDITIONAL","confidence":"MODERATE","novelty_score":7.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":0,"one_line_summary":"Linear Darboux polynomials of Lotka-Volterra systems correspond to admissible loopless hypergraphs, and for n≤5 these hypergraphs are classified up to linear equivalence, yielding a new non-tree 13-parameter superintegrable 5-component system.","lead":"This paper associates certain Lotka-Volterra systems, which admit several linear Darboux polynomials, with loopless hypergraphs, and classifies the resulting families up to linear equivalence for up to five species. It exhibits a new five-component superintegrable Lotka-Volterra system that is not equivalent to any previously known tree-system family.","discovery_kind":"extension","skeptic_critique":{"model":"deepseek-v4-flash","headline":"The claim that (34) is a new non-tree superintegrable system depends on an undocumented enumeration for the non-equivalence and on a one-line assertion for the rank-4 integrals; both are directly checkable.","rationale":"The reader's weakest assumption correctly identifies the undocumented enumeration as the main gap. The non-equivalence of (34) to a tree-system is not proven in the text by a direct calculation; it is inherited from the classification tables. Since the paper distinguishes other 5-component systems with only three independent integrals, the four-integral rank assertion is also a genuine, easily checked step. Both are computational claims, not conceptual errors, and both can be settled by straightforward independent computation. Therefore the appropriate verdict remains CONDITIONAL: the construction is explicit and the analytic lemmas are credibly proved, but the paper should supply the enumeration code/data or a direct symbolic verification of the two load-bearing assertions before the claim is accepted as fully verified.","tokens_in":127,"tokens_out":19105,"duration_ms":236547,"concrete_test":"Perform a direct computer check for matrix (34) at generic parameter values: (i) compute the 4×5 Jacobian of the logarithms of the four integrals F_i from Eq. (3) and verify that it has rank 4; (ii) solve the linear-DP conditions of Lemma 2 for all possible supports to find every linear DP of the system, and verify that no 5-dimensional basis of DPs can be transformed to the tree form of [8]—equivalently, independently enumerate the 243 size-4 loopless hypergraphs on 5 vertices and confirm that the class containing (34) is disjoint from the three tree classes (sizes 2, 8, 12 in Table 7).","verdict_should_be":"UNCHANGED","load_bearing_attack":"The central claim has two load-bearing steps. First, that the four integrals obtained from Eq. (3) for matrix (34) are functionally independent is asserted without proof; the paper itself notes that some 5-component systems with four DPs have only three independent integrals (Section 4.4, comments after (33)), so this is not automatic. Second, the assertion that (34) is not equivalent to any tree-system is supported only by the global equivalence classification in Section 4.4 and Table 4, which is said to come from generating all loopless hypergraphs for n≤5, k≤7 and determining admissibility and equivalence. The enumeration algorithm and code are not provided, and no direct argument is given for the specific non-equivalence of (34). If the enumeration missed a hypergraph, or if the equivalence computation misclassified the class containing (34), the 'new' part of the claim would fail even though the displayed matrices are correct. Both steps can be checked directly from (34) without trusting the full classification.","agreement_with_reader":"agree"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper associates n-component Lotka-Volterra systems admitting k additional linear Darboux polynomials with loopless hypergraphs of order n and size k. It derives necessary and sufficient conditions (C1)-(C3) for a linear form to be a Darboux polynomial, gives a general solution for the coefficients and matrix entries, and treats special solutions. For n ≤ 5 it classifies admissible hypergraphs and the equivalence classes induced by linear transformations of the associated LV systems, listing representative matrices and parameter counts. The principal new result is a 13-parameter 5-component LV system, Eq. (34), claimed to be superintegrable (four functionally independent integrals from four DPs) and not linearly equivalent to any tree-system. A conjecture states that nonisomorphic trees are never LV-equivalent, verified computationally for n < 9.","tokens_in":18037,"tokens_out":4463,"duration_ms":37056,"significance":"If the claims are fully established, the paper extends the known tree-system superintegrable families: the system at Eq. (34) would be the first explicit example of a 5-component superintegrable LV system not equivalent to a tree-system, and the hypergraph formulation is a useful combinatorial organizing principle. The derivation of the Darboux-polynomial conditions is careful and checkable, and the explicit parametric matrices are a useful resource. The paper also supplies a concrete falsifiable conjecture with verification up to order 8. The main deficit is that the two load-bearing verifications — functional independence of the integrals of (34) and nonexistence of an equivalence to a tree — are asserted rather than demonstrated or made reproducible.","major_comments":[{"comment":"The paper asserts that the four DPs listed for matrix (34) yield '4 functionally independent integrals' via Eq. (3), but no proof or Jacobian computation is supplied. Since the paper itself notes that some 5-component systems with four DPs have only three independent integrals (Section 4.4, comments after (33)), functional independence is not automatic. Please provide the four integrals explicitly (or their coefficient matrix) and a generic nonzero Jacobian determinant, or a rank computation for the cofactor matrix B and inverse A^{-1}.","section":"Section 4.4, matrix (34)"},{"comment":"The claim that (34) is not equivalent to a tree-system is supported only by the classification obtained from an unstated enumeration of all loopless hypergraphs for n≤5, k≤7. No algorithm, code, or equivalence-checking procedure is provided, and no direct invariant argument is given for this particular hypergraph. If the enumeration missed a hypergraph equivalent to (34), or if the equivalence computation is incomplete, the 'new' part of the claim fails. Please include the generation/equivalence code or a precise algorithmic description, and ideally a hand-checkable invariant for (34) that distinguishes it from all tree-hypergraphs.","section":"Section 4.4 and Tables 4/5"},{"comment":"The admissibility and nonequivalence counts are presented without an independent check or a description of the exact conditions used to decide admissibility and equivalence in the computer search. For reproducibility and confidence, state the exact criteria (e.g., which special cases are excluded, how the general solution conditions are tested over the parameter space) and provide code or a verification script as supplementary material.","section":"Section 4, Tables 2-4"}],"minor_comments":[{"comment":"The last row of the matrix in Eq. (34) is typeset ambiguously; the first entry appears to be a rational expression but the alignment with the other entries is unclear.","section":"Eq. (34)"},{"comment":"The text uses 'an L V-system' where 'a Lotka-Volterra system' would be clearer, and 'm >2' should be 'm > 2' for typographical consistency.","section":"Section 2, introductory paragraphs"},{"comment":"The conclusion from (27) could be spelled out: substituting the three equalities into (25) gives a sum with opposite signs, hence twice the product, so the violation of (24) is immediate.","section":"Example 8, Eq. (27)"},{"comment":"The notation T_{x,y} for the edge set of a path is used without an explicit definition of the product over the path; a clarifying sentence would help the reader follow the index bookkeeping.","section":"Eq. (11) and surrounding text"},{"comment":"For n=8, the table lists LV-equivalent hypergraph counts but the main text does not show the individual equivalence classes; cross-referencing the appendix figures more explicitly would improve readability.","section":"Table 7 and Appendix A"}],"recommendation":"major_revision","confidential_remarks":"The central new system is interesting and likely correct, but the current absence of a verifiable computation for the two key claims (functional independence and non-equivalence) makes the paper unsuitable in its present form. With a direct Jacobian computation for (34) and a reproducible enumeration/equivalence check, it would be a solid contribution. The OEIS references are fine, but the paper should make the enumeration self-contained."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Here's my take. The paper generalises the tree-systems correspondence to hypergraphs and produces a genuinely new 13-parameter 5-component Lotka-Volterra system with four linear Darboux polynomials, claimed to be superintegrable and not equivalent to any tree-system. That system, matrix (34), is the real payoff: if the claims hold, it answers the question left open by the earlier tree-systems work.\n\nThe analytic section is the strongest part. Lemma 2 gives clean necessary and sufficient conditions for a linear combination to be a Darboux polynomial, and Prop. 3 solves those conditions explicitly using a spanning tree. The derivation is self-contained, and I could verify the listed DPs for (34) by direct substitution. The hypergraph reformulation is a sensible organising device, and the explicit representative matrices make the paper easy to test against.\n\nThe soft spots are real but not structural. The classification tables for n≤5, and therefore the statement that (34) is not equivalent to a tree-system, depend on an exhaustive enumeration of loopless hypergraphs described only by 'we have generated all'. No algorithm, code, or certificate is provided, so a referee cannot reproduce the completeness from the paper alone. I'd ask the author to fix this by shipping the enumeration code or giving a direct argument that the equivalence class of (34) is not a tree class.\n\nSecond, the paper asserts that (34) yields four functionally independent integrals via Eq. (3), but does not show the computation. Since the paper itself notes that some 5-component systems with four DPs only give three independent integrals, this is not automatic. A short rank calculation would settle it; this is a one-paragraph omission, but it is load-bearing for the word 'superintegrable'. The generic-parameter caveat is acknowledged but the exceptional set is not characterised; that is minor.\n\nBoth gaps are directly checkable from the explicit matrix, which is why I don't consider them serious flaws. I'd send this to peer review. The analytic core is sound, the example is concrete, and the missing pieces are exactly what a referee can ask to be added. Not a desk reject. I'd cite the paper if I were working on LV tree-systems, and it's a decent reading-group candidate for the hypergraph construction.","headline":"Genuinely new non-tree superintegrable LV system with solid analytic support, but the completeness of the classification and the independence of the integrals are asserted rather than demonstrated.","tokens_in":18644,"tokens_out":5418,"would_cite":true,"duration_ms":46541,"reading_group":"maybe","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["37J35","05C65","34C14"],"pacs":[],"model":"deepseek-v4-flash","headline":"A 13-parameter five-species Lotka-Volterra system is superintegrable and is not linearly equivalent to any tree-system, so the tree-family does not exhaust superintegrable systems.","keywords":["Lotka-Volterra systems","Darboux polynomials","hypergraphs","superintegrable systems","tree-systems","linear equivalence","classification","integrable systems"],"falsifier":"Run an independent exhaustive search over all loopless hypergraphs on five vertices with up to seven edges, checking admissibility by conditions (C1)–(C3) and equivalence by the paper's linear-transformation test; any admissible class missing from Table 4 would break the classification. Alternatively, test the 13-parameter system (34) directly: if for a randomly chosen generic parameter set the four integrals from (3) have Jacobian rank below four, or if a linear transformation sends the system to a tree-system, then the superintegrability or non-equivalence claim would fail.","tokens_in":17609,"feed_emoji":"🕸","tokens_out":13315,"duration_ms":103742,"temperature":0.7,"pith_summary":"This paper connects loopless hypergraphs to parametric families of Lotka-Volterra equations that admit extra linear Darboux polynomials: a hypergraph with $n$ vertices and $k$ edges records which linear combinations of the $n$ species variables are polynomials whose derivative is divisible by the polynomial itself. The paper classifies, for $n\\le 5$, all such systems up to linear changes of variables, and in this classification finds a 13-parameter 5-component system that is superintegrable—it has four functionally independent integrals—yet is not linearly equivalent to any tree-system. This matters because earlier work had built a large family of superintegrable Lotka-Volterra systems from trees, and the new example shows that family does not exhaust the superintegrable systems. The paper also verifies for $n<9$ and conjectures for all $n$ that different trees always give inequivalent tree-systems.","feed_headline":"Hypergraph search finds a new superintegrable Lotka-Volterra family","feed_subtitle":"Five-species predator-prey class has four independent integrals and is not equivalent to any known tree-system.","key_machinery":"The engine is the linear Darboux polynomial $P_I=\\sum_{i\\in I}\\alpha_i x_i$ and the necessary and sufficient conditions C1–C3 for it to be a Darboux polynomial of system (2): the $b$-components on $I$ must agree, the columns of $A$ over $I^c$ must agree, and the entries of $A$ inside $I$ must satisfy the ratio equations (C3). The general solution is generated by choosing a tree $T$ on the index set $I$: coefficients $\\alpha_j$ are products of ratios $(A_{x,y}-A_{y,y})/(A_{x,x}-A_{y,x})$ along the path from a base vertex to $j$, and every non-tree entry of $A$ is forced by a product over a path. This turns the Darboux-polynomial conditions into hypergraph constraints, so families of systems with several DPs correspond to hypergraphs, and the linear transformations under which new variables are again Darboux polynomials give the equivalence relation used in the classification.","core_discovery":"The central claim is that the correspondence between trees and superintegrable Lotka-Volterra systems extends, with extra combinatorial structure, to hypergraphs: every admissible loopless hypergraph of order $n$ and size $k$ carries a generic class of $n$-component Lotka-Volterra systems with $k$ additional linear Darboux polynomials, and linear transformations of the variables induce an equivalence relation on admissible hypergraphs. For $n\\le5$ the paper gives the complete list of nonequivalent admissible hypergraphs for $k\\le7$ (and for $k=10$), together with representative interaction matrices. The main discovery in that list is the 5-component system (34), whose DPs correspond to the 2-edges $\\{1,2\\}$, $\\{1,3\\}$, $\\{2,4\\}$ and the 3-edge $\\{1,2,5\\}$; it has 13 parameters, four functionally independent integrals of the form (3), and is not equivalent by a linear transformation to any tree-system. Hence tree-systems, although they remain maximal at $n=5$, no longer account for all superintegrable Lotka-Volterra systems.","pith_inferences":["The paper's enumeration stops at $n=5$ mainly because the number of hypergraphs grows extremely fast; extending the same admissibility test to $n=6$ would show whether further non-tree superintegrable systems appear already at low dimension.","The new system's 13 parameters match the $3n-2$ count of tree-systems, suggesting the natural next question is whether every superintegrable hypergraph-system at $n>5$ also saturates this parameter count or whether larger hyperedges require more parameters.","Because the size-8 hypergraphs on five vertices are all inadmissible while the size-10 complete graph is admissible, adding one DP at $n=5$ can force a jump to a complete hypergraph; a similar 'closure' phenomenon may organise the admissible classes for larger $n$."],"forward_implications":["For $n\\le5$, the tables list all nonequivalent systems with up to seven additional linear Darboux polynomials; any such system is either one of the listed classes or a special parameter subcase.","The 13-parameter system (34) is superintegrable with four independent integrals, so it has maximal integral count at $n=5$ despite not being a tree-system.","For $n=5$, there are no admissible hypergraphs of size 8 or 9; the only admissible class beyond size 7 is the size-10 complete-graph family.","If Conjecture 12 is true for all $n$, nonisomorphic trees give inequivalent tree-systems, making the tree itself a complete invariant for this family.","The hyperforest construction extends the classification to nonhomogeneous Lotka-Volterra systems without changing the DPs."],"supporting_citations":[{"why":"Introduces the tree–Lotka-Volterra correspondence and the two-variable Darboux-polynomial conditions that the hypergraph construction generalizes.","marker":"[5]"},{"why":"Establishes that tree-systems are maximally superintegrable with $n-1$ DPs and $3n-2$ parameters; the new system is compared against this class.","marker":"[8]"},{"why":"Supplies the enumeration of loopless hypergraphs whose counts appear in Table 1 and underlies the exhaustive search for $n\\le5$.","marker":"[2]"},{"why":"Gives the three-variable condition $C_{h,j,k}=0$ used to test admissibility of 3-DPs.","marker":"[3]"},{"why":"Provides the Darboux-polynomial method by which powers of DPs combine into integrals of the form (3).","marker":"[1]"},{"why":"Supports the extension of homogeneous classifications to nonhomogeneous systems with constant $b$.","marker":"[7]"}],"fun_headline_variants":["Hypergraph search finds new superintegrable predator-prey family","New 5-species Lotka-Volterra system not equivalent to any tree-system","Hypergraphs reveal novel superintegrable system beyond trees","13-parameter superintegrable system eludes tree classification","Hypergraph method discovers new superintegrable LV class"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The classification and the non-equivalence of the 13-parameter system to any tree-system rest on an exhaustive computer enumeration of all loopless hypergraphs with up to five vertices and seven edges, but the algorithm and code for that enumeration are not given.","fun_headline_variants_meta":{"raw":{"variants":["Hypergraph search finds new superintegrable predator-prey family","New 5-species Lotka-Volterra system not equivalent to any tree-system","Hypergraphs reveal novel superintegrable system beyond trees","13-parameter superintegrable system eludes tree classification","Hypergraph method discovers new superintegrable LV class"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000505,"raw_usage":{"total_tokens":2441,"prompt_tokens":899,"completion_tokens":1542,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":515,"completion_tokens_details":{"reasoning_tokens":1452}},"tokens_in":515,"tokens_out":1542,"duration_ms":9887,"temperature":1.0,"reasoning_tokens":1452,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-12T11:21:57.336967+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Run an independent exhaustive search over all loopless hypergraphs on five vertices with up to seven edges, checking admissibility by conditions (C1)–(C3) and equivalence by the paper's linear-transformation test; any admissible class missing from Table 4 would break the classification. Alternatively, test the 13-parameter system (34) directly: if for a randomly chosen generic parameter set the four integrals from (3) have Jacobian rank below four, or if a linear transformation sends the system to a tree-system, then the superintegrability or non-equivalence claim would fail.","supporting_citations":[{"cited_title":"Quispel, B","cited_arxiv_id":null,"evidence_quote":"Introduces the tree–Lotka-Volterra correspondence and the two-variable Darboux-polynomial conditions that the hypergraph construction generalizes."},{"cited_title":"van der Kamp, G.R.W","cited_arxiv_id":null,"evidence_quote":"Establishes that tree-systems are maximally superintegrable with $n-1$ DPs and $3n-2$ parameters; the new system is compared against this class."},{"cited_title":"Hedge, M.R","cited_arxiv_id":null,"evidence_quote":"Supplies the enumeration of loopless hypergraphs whose counts appear in Table 1 and underlies the exhaustive search for $n\\le5$."},{"cited_title":"Maier, The integration of three-dimensional Lotka-Volterra systems, Proc","cited_arxiv_id":null,"evidence_quote":"Gives the three-variable condition $C_{h,j,k}=0$ used to test admissibility of 3-DPs."},{"cited_title":"Goriely, Integrability and Nonintegrability of Dynamical Systems (2001) World Scientific","cited_arxiv_id":null,"evidence_quote":"Provides the Darboux-polynomial method by which powers of DPs combine into integrals of the form (3)."},{"cited_title":"van der Kamp, D.I","cited_arxiv_id":null,"evidence_quote":"Supports the extension of homogeneous classifications to nonhomogeneous systems with constant $b$."}],"review_version":1}