相关论文: Expander Evolution Algebras

We will study evolution algebras $A$ which are free modules of dimension $2$ over domains. Furthermore, we will assume that these algebras are perfect, that is $A^2=A$. We start by making some general considerations about algebras over…

Let $A$ be a finite dimensional associative algebra with derivations over a field of characteristic zero, i.e., an algebra whose structure is enriched by the action of a Lie algebra $L$ by derivations, and let $c_n^L(A),$ $n\geq 1,$ be its…

In this article we study algebraic structures of function spaces defined by graphs and state spaces equipped with Gibbs measures by associating evolution algebras. We give a constructive description of associating evolution algebras to the…

We study the space of derivations for some finite-dimensional evolution algebras, depending on the twin partition of an associated directed graph. For evolution algebras with a twin-free associated graph we prove that the space of…

We consider the intersection $\mathfrak{M}(A)$ of all maximal ideals of an evolution algebra $A$ and study the structure of the quotient $A/\M(A)$. In a previous work, maximal ideals have been related to hereditary subsets of a graph…

We consider an evolution algebra which corresponds to a bisexual population with a set of females partitioned into finitely many different types and the males having only one type. We study basic properties of the algebra. This algebra is…

This work classifies three-dimensional simple evolution algebras over arbitrary fields. For this purpose, we use tools such as the associated directed graph, the moduli set, inductive limit group, Zariski topology and the dimension of the…

Coboundary and cosystolic expansion are notions of expansion that generalize the Cheeger constant or edge expansion of a graph to higher dimensions. The classical Cheeger inequality implies that for graphs edge expansion is equivalent to…

Evolution algebras are non-associative algebras that describe non-Mendelian hereditary processes and have connections with many other areas. In this paper we obtain necessary and sufficient conditions for a given algebra $A$ to be an…

Conformal algebras, recently introduced by Kac, encode an axiomatic description of the singular part of the operator product expansion in conformal field theory. The objective of this paper is to develop the theory of ``multi-dimensional''…

A tree diagram is a tree with positive integral weight on each edge, which is a notion generalized from the Dynkin diagrams of finite-dimensional simple Lie algebras. We introduce two nilpotent Lie algebras and their extended solvable Lie…

Evolution algebras are non-associative algebras. In this work we provide an extension of this class of algebras, in the context of Hilbert spaces, capable to deal with infinite-dimensional spaces. We illustrate the applicability of our…

A matrix-weighted graph is an undirected graph with a $k\times k$ positive semidefinite matrix assigned to each edge. There are natural generalizations of the Laplacian and adjacency matrices for such graphs. These matrices can be used to…

In this paper we study subalgebras of complex finite dimensional evolution algebras. We obtain the classification of nilpotent evolution algebras whose any subalgebra is an evolution subalgebra with a basis which can be extended to a…

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…

Evolutionary algorithms (EAs) are population-based metaheuristics, originally inspired by aspects of natural evolution. Modern varieties incorporate a broad mixture of search mechanisms, and tend to blend inspiration from nature with…

This short note provides positive answers to two conjectures of Camacho, Khudoyberdiyev, and Omirov on the classification of complete evolution algebras. Our approach is based on analysing the solution set of a generic non-linear polynomial…

Evolutionary algorithms (EAs) simulate natural selection but have two main limitations: (1) they rarely update individuals based on global correlations, limiting comprehensive learning; (2) they struggle with balancing exploration and…

We prove a general large sieve statement in the context of random walks on subgraphs of a given graph. This can be seen as a generalization of previously known results where one performs a random walk on a group enjoying a strong spectral…

Evolutionary algorithms (EAs), a large class of general purpose optimization algorithms inspired from the natural phenomena, are widely used in various industrial optimizations and often show excellent performance. This paper presents an…