Papers
Topics
Authors
Recent
2000 character limit reached

Hypergraphs and Lotka-Volterra systems with linear Darboux polynomials (2411.18264v4)

Published 27 Nov 2024 in nlin.SI and math.DS

Abstract: We associate parametric classes of $n$-component Lotka-Volterra systems which admit $k$ additional linear Darboux polynomials, with admissible loopless hypergraphs of order $n$ and size $k$. We study the equivalence relation on admissible hypergraphs induced by linear transformations of the associated LV-systems, for $n\leq 5$. We present a new 13-parameter 5-component superintegrable Lotka-Volterra system, i.e. one that is not equivalent to a so-called tree-system. We conjecture that tree-systems associated with nonisomorphic trees are not equivalent, which we verified for $n<9$.

Summary

We haven't generated a summary for this paper yet.

Whiteboard

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

Collections

Sign up for free to add this paper to one or more collections.

Tweets

Sign up for free to view the 2 tweets with 13 likes about this paper.