Related papers: Morphisms and automorphisms of skew-symmetric Lotk…
The purpose of this paper is to study the structure of Lotka-Volterra algebras, the set of their idempotent elements and their group of automorphisms. These algebras are defined through antisymmetric matrices and they emerge in connection…
Cluster automorphisms have been shown to have links to the mapping class groups of surfaces, maximal green sequences and to exchange graph automorphisms for skew-symmetric cluster algebras. In this paper we aim to generalise these results…
In this paper, we introduce Volterra evolution algebras which are evolution algebras whose structural matrices are described by skew symmetric matrices. A main result of the present paper gives a connection between such kind of algebras…
The Kahan discretization of the Lotka-Volterra system, associated with any skew-symmetric graph $\Gamma$, leads to a family of rational maps, parametrized by the step size. When these maps are Poisson maps with respect to the quadratic…
The monography examines the problem of constructing a group of automorphisms of a graph. A graph automorphism is a mapping of a set of vertices onto itself that preserves adjacency. The set of such automorphisms forms a vertex group of a…
Understanding the structure of a graph along with the structure of its subgraphs is important for several problems in graph theory. Two examples are the Reconstruction Conjecture and isomorph-free generation. This paper raises the question…
We present groupoid morphisms as an algebraic structure for nonautonomous dynamics, as well as a generalization of group morphisms, which describe classic dynamical systems. We introduce the structure of cotranslations, as a specific kind…
Circulant graphs are a widely studied family of graphs whose members possess varying amounts of symmetry. Although considerable progress has been made in finding the automorphism groups of circulant graphs under certain restrictions, a…
We define a graded graph, called the Schur--Weyl graph, which arises naturally when one considers simultaneously the RSK algorithm and the classical duality between representations of the symmetric and general linear groups. As one of the…
We consider general integrable systems on graphs as discrete flat connections with the values in loop groups. We argue that a certain class of graphs is of a special importance in this respect, namely quad-graphs, the cellular…
In this work, we establish a relationship between the sum of irreducible character degrees and the number of twisted involutions associated with the automorphisms of a finite group. We develop algorithmic frameworks for evaluating these…
A theorem of Kontsevich relates the homology of certain infinite dimensional Lie algebras to graph homology. We formulate this theorem using the language of reversible operads and mated species. All ideas are explained using a pictorial…
We study skew-orthogonal polynomials with respect to the weight function $\exp[-2V(x)]$, with $V(x)=\sum_{K=1}^{2d}(u_{K}/{K})x^{K}$, $u_{2d} > 0$, $d > 0$. A finite subsequence of such skew-orthogonal polynomials arising in the study of…
We investigate the Sherali-Adams lift & project hierarchy applied to a graph isomorphism polytope whose integer points encode the isomorphisms between two graphs. In particular, the Sherali-Adams relaxations characterize a new vertex…
We examine the algebraic complete integrability of Lotka-Volterra equations in three dimensions. We restrict our attention to Lotka-Volterra systems defined by a skew symmetric matrix. We obtain a complete classification of such systems.…
This is an expository article. We survey some fundamental trends in representation theory of symmetric groups and related objects which became apparent in the last fifteen years. The emphasis is on connections with Lie theory via…
We define a special sort of weighted oriented graphs, signed quivers. Each of these yields a symmetric quiver, i.e., a quiver endowed with an involutive anti-automorphism and the inherited signs. We develop a representation theory of…
We study the automorphism group of graphons (graph limits). We prove that after an appropriate "standardization" of the graphon, the automorphism group is compact. Furthermore, we characterize the orbits of the automorphism group on…
Symmetric edge polytopes are lattice polytopes associated with finite simple graphs that are of interest in both theory and applications. We investigate the facet structure of symmetric edge polytopes for various models of random graphs.…
It is known that there is a one-to-one mapping between oriented directed graphs and zero-sum replicator dynamics (Lotka-Volterra equations) and that furthermore these dynamics are Hamiltonian in an appropriately defined nonlinear Poisson…