Related papers: Integrability of Generalised Skew-Symmetric Replic…
The replicator equations are a family of ordinary differential equations that arise in evolutionary game theory, and are closely related to Lotka-Volterra. We produce an infinite family of replicator equations which are Liouville-Arnold…
We present a method for associating labeled directed graphs to finite-dimensional Lie algebras, thereby enabling rapid identification of key structural algebraic features. To formalize this approach, we introduce the concept of…
The regular embeddings of complete bipartite graphs $K_{n,n}$ in orientable surfaces are classified and enumerated, and their automorphism groups and combinatorial properties are determined. The method depends on earlier classifications in…
This paper considers the problem of embedding directed graphs in Euclidean space while retaining directional information. We model a directed graph as a finite set of observations from a diffusion on a manifold endowed with a vector field.…
The inductive biases of graph representation learning algorithms are often encoded in the background geometry of their embedding space. In this paper, we show that general directed graphs can be effectively represented by an embedding model…
An embedding of a graph on an orientable surface is orientably-regular (or rotary, in an equivalent terminology) if the group of orientation-preserving automorphisms of the embedding is transitive (and hence regular) on incident vertex-edge…
In \cite{4} Kauffman and Vogel constructed a rigid vertex regular isotopy invariant for unoriented four-valent graphs embedded in three dimensional space. It assigns to each embedded graph $G$ a polynomial, denoted $[G]$, in three…
This paper considers *-graphs in which all vertices have degree 4 or 6, and studies the question of calculating the genus of nonorientable surfaces into which such graphs may be embedded. In a previous paper by the authors, the problem of…
We study the basic relation between skew-symmetric Lotka-Volterra systems and graphs, both at the level of objects and morphisms, and derive a classification from it of skew-symmetric Lotka-Volterra systems in terms of graphs as well as in…
There is a Turing computable embedding $\Phi$ of directed graphs $A$ in undirected graphs. Moreover, there is a fixed tuple of formulas that give a uniform interpretation; i.e., for all directed graphs $A$, these formulas interpret $A$ in…
The pentagram map was introduced by R. Schwartz more than 20 years ago. In 2009, V. Ovsienko, R. Schwartz and S. Tabachnikov established Liouville complete integrability of this discrete dynamical system. In 2011, M. Glick interpreted the…
Motivated by the notion of integrability introduced by Bogoyavlenskij for vector fields, we propose a definition of smooth integrability for general diffeomorphisms. In brief, we say that a diffeomorphism is integrable if it commutes with…
A number of examples of Hamiltonian systems that are integrable by classical means are cast within the framework of isospectral flows in loop algebras. These include: the Neumann oscillator, the cubically nonlinear Schr\"odinger systems and…
Graph embedding has become an increasingly important technique for analyzing graph-structured data. By representing nodes in a graph as vectors in a low-dimensional space, graph embedding enables efficient graph processing and analysis…
Recently, one has seen a surge of interest in developing such methods including ones for learning such representations for (undirected) graphs (while preserving important properties). However, most of the work to date on embedding graphs…
We propose a novel node embedding of directed graphs to statistical manifolds, which is based on a global minimization of pairwise relative entropy and graph geodesics in a non-linear way. Each node is encoded with a probability density…
The pentagram map that associates to a projective polygon a new one formed by intersections of short diagonals was introduced by R. Schwartz and was shown to be integrable by V. Ovsienko, R. Schwartz and S. Tabachnikov. Recently, M. Glick…
This paper proposes a family of permutation-invariant graph embeddings, generalizing the Skew Spectrum of graphs of Kondor & Borgwardt (2008). Grounded in group theory and harmonic analysis, our method introduces a new class of graph…
The Induced Graph Matching problem asks to find k disjoint induced subgraphs isomorphic to a given graph H in a given graph G such that there are no edges between vertices of different subgraphs. This problem generalizes the classical…
This paper considers *-graphs in which all vertices have degree 4 or 6, and studies the question of calculating the genus of orientable 2-surfaces into which such graphs may be embedded. A *-graph is a graph endowed with a formal adjacency…