Related papers: On real chains of evolution algebras
Evolutionary Algorithms (EAs) and other randomized search heuristics are often considered as unbiased algorithms that are invariant with respect to different transformations of the underlying search space. However, if a certain amount of…
Evolution algebras with one dimensional square are classified using the theory of inner product spaces. More precisely, for $A$ an evolution algebra with $\dim(A^2) = 1$ and $a$ a generator of $A^2$, the product of $A$ is given by $xy =…
A sequential effect algebra (SEA) is an effect algebra equipped with a sequential product operation modeled after the L\"uders product $(a,b)\mapsto \sqrt{a}b\sqrt{a}$ on C*-algebras. A SEA is called normal when it has all suprema of…
Evolution is one of the major omnipresent powers in the universe that has been studied for about two centuries. Recent scientific and technical developments make it possible to make the transition from passively understanding to actively…
Evolution algebras are non-associative algebras inspired from biological phenomena, with applications to or connections with different mathematical fields. There are two natural ways to define an evolution algebra associated to a given…
We define a deterministic family of permutations generated by an alternating center-edge extraction process on the ordered set [n] = {1,2,...,n}. Starting from the ordered list (1,2,...,n), one repeatedly removes the median element or…
Following a previous work with Boudi, we continue to investigate Bernstein algebras satisfying chain conditions. First, it is shown that a Bernstein algebra $(A, \omega)$ with ascending or descending chain condition on subalgebras is…
A permutation array(permutation code, PA) of length $n$ and distance $d$, denoted by $(n,d)$ PA, is a set of permutations $C$ from some fixed set of $n$ elements such that the Hamming distance between distinct members…
We give a geometric classification of $n$-dimensional nilpotent, commutative nilpotent and anticommutative nilpotent algebras. We prove that the corresponding geometric varieties are irreducible, find their dimensions and describe explicit…
A sequential effect algebra (SEA) is an effect algebra on which a sequential product is defined. We present examples of effect algebras that admit a unique, many and no sequential product. Some general theorems concerning unique sequential…
The circular descent of a permutation $\sigma$ is a set $\{\sigma(i)\mid \sigma(i)>\sigma(i+1)\}$. In this paper, we focus on the enumerations of permutations by the circular descent set. Let $cdes_n(S)$ be the number of permutations of…
The paper is devoted to the study of annihilator extensions of evolution algebras and suggests an approach to classify finite-dimensional nilpotent evolution algebras. Subsequently nilpotent evolution algebras of dimension up to four are…
The Atomic Cluster Expansion (ACE) [R. Drautz, Phys. Rev. B, 99:014104 (2019)] provides a systematically improvable, universal descriptor for the environment of an atom that is invariant to permutation, translation and rotation. ACE is…
The set of all permutations with $n$ symbols is a symmetric group denoted by $S_n$. A transposition tree, $T$, is a spanning tree over its $n$ vertices $V_T=${$1, 2, 3, \ldots n$} where the vertices are the positions of a permutation $\pi$…
A permutation graph is a graph whose edges are given by inversions of a permutation. We study the Abelian sandpile model (ASM) on such graphs. We exhibit a bijection between recurrent configurations of the ASM on permutation graphs and the…
Let $\theta(n)$ denote the number of permutations of $\{1,2,\ldots,n\}$ that do not contain a 3-term arithmetic progression as a subsequence. Such permutations are known as 3-free permutations. We present a dynamic programming algorithm to…
Let $k$ be an algebraically closed base field of characteristic zero. The category equivalence between central simple algebras and irreducible, generically free $PGL_n$-varieties is extended to the context of central simple algebras with…
We carry out the classification of abelian Lie symmetry algebras of two-dimensional second-order nondegenerate quasilinear evolution equations. It is shown that such an equation is linearizable if it admits an abelian Lie symmetry algebra…
Combinatorial designs provide an interesting source of optimization problems. Among them, permutation codes are particularly interesting given their applications in powerline communications, flash memories, and block ciphers. This paper…
Billey et al. [arXiv:1507.04976] have recently discovered a surprisingly simple formula for the number $a_n(\sigma)$ of leaf-labelled rooted non-embedded binary trees (also known as phylogenetic trees) with $n\geq 1$ leaves, fixed (for the…