Related papers: On real chains of evolution algebras
We introduce enumerative invariants $F_{g,n}$ $(g\geq0$, $n \geq 1)$ associated to a cyclic $A_\infty$ algebra and a splitting of its non-commutative Hodge filtration. These invariants are defined by explicitly computable Feynman sums, and…
In this article we study the differentiability of solutions of parabolic semilinear stochastic evolution equations (SEEs) with respect to their initial values. We prove that if the nonlinear drift coefficients and the nonlinear diffusion…
The constant $C_A(n)$ is defined to be the smallest natural number $k$ such that any sequence of $k$ elements in $\mathbb Z_n$ has a subsequence of consecutive terms whose $A$-weighted sum is zero, where the weight set $A\subseteq \mathbb…
We introduce consecutive equi-$n$-squares, a variant of equi-$n$-squares in which at least one row or column forms a fixed permutation of $\{1,\dots,n\}$, taken for concreteness to be $(1,\dots,n)$. More generally, the enumeration and…
The Semantic Theory of Evolution (STE) takes the existence of a number of arbitrary communication codes as a fundamental feature of life, from the genetic code to human cultural communication codes. Their arbitrariness enables, at each…
Given a finite-dimensional noncommutative semisimple algebra $A$ with involution, we show that $A$ always has an RBA-basis. We look for an RBA-basis that has integral or rational structure constants, and ask if the RBA admits a positive…
Non-degenerate bilinear forms over fields of characteristic 2, in particular, non-symmetric ones, are classified with respect to various equivalences, and the Lie algebras preserving them are described. Although it is known that there are…
The space of derivations of finite dimensional evolution algebras associated to graphs over a field with characteristic zero has been completely characterized in the literature. In this work we generalize that characterization by describing…
Lie algebras of dimension $n$ are defined by their structure constants , which can be seen as sets of $N = n^2 (n -- 1)/2$ scalars (if we take into account the skew-symmetry condition) to which the Jacobi identity imposes certain quadratic…
$\beta(1,0)$-trees provide a convenient description of rooted non-separable planar maps. The involution $h$ on $\beta(1,0)$-trees was introduced to prove a complicated equidistribution result on a class of pattern-avoiding permutations. In…
Various coordinate rings of varieties appearing in the theory of Poisson Lie groups and Poisson homogeneous spaces belong to the large, axiomatically defined class of symmetric Poisson nilpotent algebras, e.g. coordinate rings of Schubert…
A permutation graph is a graph that can be derived from a permutation, where the vertices correspond to letters of the permutation, and the edges represent inversions. We provide a construction to show that there are infinitely many…
The problem of efficiently characterizing degree sequences of simple hypergraphs is a fundamental long-standing open problem in Graph Theory. Several results are known for restricted versions of this problem. This paper adds to the list of…
For sufficiently high dimensions, the naturally graded nonsplit nilpotent Lie algebras with linear characteristic sequence are classified.
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. For such algebras in terms of its structure constants we…
We study certain "\sigma-commuting varieties" associated with a pair of commuting involutions of a semisimple Lie algebra $\g$. The usual commuting variety of $\g$ and commuting varieties related to one involution are particular cases of…
Define $I_n^k(\alpha)$ to be the set of involutions of $\{1,2,...,n\}$ with exactly $k$ fixed points which avoid the pattern $\alpha \in S_i$, for some $i \geq 2$, and define $I_n^k(\emptyset;\alpha)$ to be the set of involutions of…
A new model for evolving Evolutionary Algorithms (EAs) is proposed in this paper. The model is based on the Multi Expression Programming (MEP) technique. Each MEP chromosome encodes an evolutionary pattern that is repeatedly used for…
A necklace is an equivalence class of words of length $n$ over an alphabet under the cyclic shift (rotation) operation. As a classical object, there have been many algorithmic results for key operations on necklaces, including counting,…
We present a new perfect simulation algorithm for stationary chains having unbounded variable length memory. This is the class of infnite memory chains for which the family of transition probabilities is represented by a probabilistic…