Related papers: Evolution algebras and graphs
A circulant (di)graph is a (di)graph on n vertices that admits a cyclic automorphism of order n. This paper provides a survey of the work that has been done on finding the automorphism groups of circulant (di)graphs, including the…
We study polynomial identities of algebras with involution of nonassociative algebras over a field of characteristic zero. We prove that the growth of the sequence of $*$-codimensions of a finite-dimensional algebra is exponentially…
Among the mutation finite cluster algebras the tubular ones are a particularly interesting class. We show that all tubular (simply laced) cluster algebras are of exponential growth by two different methods: first by studying the…
We define a notion of (one-sided) edge shift spaces associated to ultragraphs. In the finite case our notion coincides with the edge shift space of a graph. In general, we show that our space is metrizable and has a countable basis of…
The principal filtration of the infinite-dimensional odd Contact Lie superalgebra over a field of characteristic $p>2$ is proved to be invariant under the automorphism group by investigating ad-nilpotent elements and determining certain…
Graphs are used to represent a plethora of phenomena, from the Web and social networks, to biological pathways, to semantic knowledge bases. Arguably the most interesting and important questions one can ask about graphs have to do with…
For a representation of a Lie algebra, one can construct a diagram of the representation, i. e. a directed graph with edges labeled by matrix elements of the representation. This article explains how to use these diagrams to describe normal…
In mathematical phylogenetics, evolutionary relationships are often represented by trees and networks. The latter are typically used whenever the relationships cannot be adequately described by a tree, which happens when so-called…
We present a list of (1+1)-dimensional second-order evolution equations all connected via a proposed generalised hodograph transformation, resulting in a tree of equations transformable to the linear second-order autonomous evolution…
We show that the automorphism group of every zero entropy infinite shift admits a "drift" homomorphism to $(\mathbb{R},+)$ that maps the shift map to 1. This homomorphism arises as the expectation, under an invariant measure, of a cocycle…
We prove that any potential symmetry of a system of evolution equations reduces to a Lie symmetry through a nonlocal transformation of variables. Based on this fact is our method of group classification of potential symmetries of systems of…
In Chapter 1 we fully characterise pairs of finite graphs which form a gap in the full homomorphism order. This leads to a simple proof of the existence of generalised duality pairs. We also discuss how such results can be carried to…
A complete classifications of two-dimensional general, commutative, commutative Jordan, division and evolution real algebras are given. In the case of evolution algebras their groups of automorphisms and derivation algebras are described as…
The presented material is devoted to the equivalent conversion from the vertex graphs to the edge graphs. We suggest that the proved theorems solve the problem of the isomorphism of graphs, the problem of the graph's enumeration with the…
We prove that the action of the Grothendieck-Teichm\"uller group on the genus completed properad of (homotopy) Lie bialgebras commutes with the reversing directions involution of the latter. We also prove that every universal quantization…
Classification, up to isomorphism, of algebras from a non-empty subset of the variety of $n$- dimensional algebras is presented. It is shown that these algebras have only trivial automorphism and if the basic field is algebraically closed…
Theory of representations of universal algebra is a natural development of the theory of universal algebra. In the book, I considered representation of universal algebra, diagram of representations and examples of representation. Morphism…
The class of evolving groups is defined and investigated, as well as their connections to examples in the field of Galois cohomology. Evolving groups are proved to be Sylow Tower groups in a rather strong sense. In addition, evolving groups…
Graphs with diverse structural characteristics play a central role in modelling and optimization tasks. The ability to generate different types of graphs that exhibit shared properties is likewise essential for algorithm selection and…
We give a non-abelian analogue of Whitney's 2-isomorphism theorem for graphs. Whitney's theorem states that the cycle space determines a graph up to 2-isomorphism. Instead of considering the cycle space of a graph which is an abelian…