Related papers: Hypergraphs and Lotka-Volterra systems with linear…
We apply the Darboux theory of integrability to polynomial ODE's of dimension 3. Using this theory and computer algebra, we study the existence of first integrals for the 3-dimensional Lotka-Volterra systems with polynomial invariant…
This is a survey on the Darboux theory of integrability for polynomial vector fields, first in $\R^n$ and second in the $n$-dimensional sphere $\sss^n$. We also provide new results about the maximum number of parallels and meridians that a…
We introduce a new family of planar Lotka--Volterra systems admitting explicit invariant algebraic curves of arbitrarily high degree.
Counting non-isomorphic tree-like multigraphs that include self-loops and multiple edges is an important problem in combinatorial enumeration, with applications in chemical graph theory, polymer science, and network modeling. Traditional…
This paper is devoted to the system of coupled KdV-like equations. It is shown that this apparently non-integrable system possesses an integrable reduction which is closely related to the Volterra chain. This fact is used to construct the…
We extend the results of Zhang et al. to show that $\lambda$ is an eigenvalue of a $k$-uniform hypertree $(k \geq 3)$ if and only if it is a root of a particular matching polynomial for a connected induced subtree. We then use this to…
In this paper, we introduce a new problem called Tree-Residue Vertex-Breaking (TRVB): given a multigraph $G$ some of whose vertices are marked "breakable," is it possible to convert $G$ into a tree via a sequence of "vertex-breaking"…
We construct a large family of evidently integrable Hamiltonian systems which are generalizations of the KM system. The Hamiltonian vector field is homogeneous cubic but in a number of cases a simple change of variables transforms such a…
We study isometric actions of tree automorphism groups on the infinite-dimensional hyperbolic spaces. On the one hand, we exhibit a general one-parameter family of such representations and analyse the corresponding equivariant embeddings of…
The Hamiltonian structure of a class of three-dimensional (3D) Lotka-Volterra (LV) equations is revisited from a novel point of view by showing that the quadratic Poisson structure underlying its integrability structure is just a real…
It is shown that the description of certain class of representations of the holonomy Lie algebra associated to hyperplane arrangement $\Delta$ is essentially equivalent to the classification of $\vee$-systems associated to $\Delta.$ The…
Considering systems of separations in a graph that separate every pair of a given set of vertex sets that are themselves not separated by these separations, we determine conditions under which such a separation system contains a nested…
Previous work has shown that the classification of indecomposable off-shell representations of N-supersymmetry, depicted as Adinkras, may be factored into specifying the topologies available to Adinkras, and then the height-assignments for…
We revisit the calculation of holographic correlators in $AdS_3$. We develop new methods to evaluate exchange Witten diagrams, resolving some technical difficulties that prevent a straightforward application of the methods used in higher…
A parameter-dependent class of Hamiltonian (generalized) Lotka-Volterra systems is considered. We prove that this class contains Liouville integrable as well as superintegrable cases according to particular choices of the parameters. We…
We introduce integrable multicomponent non-commutative lattice systems, which can be considered as analogs of the modified Gel'fand-Dikii hierarchy. We present the corresponding systems of Lax pairs and we show directly multidimensional…
A connected graph of order $n$ admitting a semiregular automorphism of order $n/k$ is called a $k$-multicirculant. Highly symmetric multicirculants of small valency have been extensively studied, and several classification results exist for…
In this paper, we study transfer functions corresponding to parametric linear systems whose coefficients are block matrices. Thus, these transfer functions constitute Laurent polynomials whose coefficients are square matrices. We assume…
In 2001, Koml\'os, S\'ark\"ozy, and Szemer\'edi proved that every sufficiently large $n$-vertex graph with minimum degree at least $\left(1/2+\gamma\right)n$ contains all spanning trees with maximum degree at most $cn/\log n$. We extend…
In a coupled network cells can interact in several ways. There is a vast literature from the last twenty years that investigates this interacting dynamics under a graph theory formalism, namely as a graph endowed with an input-equivalence…