Related papers: Finitely Generated Nil but Not Nilpotent Evolution…
This work investigates the existence of complex structures on 2-step nilpotent Lie algebras arising from finite graphs. We introduce the notion of adapted complex structure, namely a complex structure that maps vertices and edges of the…
We prove that a map onto a nilpotent group $Q$ has finitely generated kernel if and only if the preimage of the positive cone is coarsely connected as a subset of the Cayley graph for every full archimedean partial order on $Q$. In case $Q$…
For a finite group $G$ and a non-negative integer $d$, denote by $\Omega_d(G)$ the number of functions $G^d\rightarrow G$ that are induced by substitution into a word with variables among $X_1,\ldots,X_d$. In this note, we show that…
For any discrete time dynamical system with a rational evolution, we define an entropy, which is a global index of complexity for the evolution map. We analyze its basic properties and its relations to the singularities and the…
The problem of classifying tuples of nilpotent matrices over a field under simultaneous conjugation is considered "hopeless". However, for any given matrix order over a finite field, the number of concerned orbits is always finite. This…
We consider the problem of extending maps from algebras to their profinite completions in finitely generated quasivarieties. Our developments are based on the construction of the profinite completion of an algebra as its natural extension.…
In this paper, for a given finitely generated algebra (an algebraic structure with arbitrary operations and no predicates) A we study finitely generated limit algebras of A, approaching them via model theory and algebraic geometry. Along…
By combining well-known techniques from both noncommutative algebra and computational commutative algebra, we observe that an algorithmic approach can be applied to the study of irreducible representations of finitely presented algebras. In…
Computation of polynomial relative invariants is a classical tool in algebra. Relative differential invariants are central for the equivalence problem of geometric structures. We address the fundamental problem of finite generation of their…
We investigate the class of finite dimensional not necessary associative algebras that have slowly growing length, that is, for any algebra in this class its length is less than or equal to its dimension. We show that this class is…
Even if it has been less than a decade and a half since Tian introduced his concept of evolution algebras to represent algebraically non-Mendelian rules in Genetics, their study is becoming increasingly widespread mainly due to their…
Metabelian algebras are introduced and it is shown that an algebra $A$ is metabelian if and only if $A$ is a nilpotent algebra having the index of nilpotency at most $3$, i.e. $x y z t = 0$, for all $x$, $y$, $z$, $t \in A$. We prove that…
We consider absolutely free nonassociative algebras and, more generally, absolutely free algebras with (maybe infinitely) many multilinear operations. Such algebras are described in terms of labeled reduced planar rooted trees. This allows…
The Grigorchuk and Gupta-Sidki groups are natural examples of self-similar finitely generated periodic groups. The author constructed their analogue in case of restricted Lie algebras of characteristic 2, Shestakov and Zelmanov extended…
Generating trees are a useful technique in the enumeration of various combinatorial objects, particularly restricted permutations. Quite often the generating tree for the set of permutations avoiding a set of patterns requires infinitely…
We describe an algorithm for deciding whether or not a given finitely generated torsion-free nilpotent group is decomposable as the direct product of nontrivial subgroups.
Let $G$ be an adjoint algebraic group of type $B$, $C$, or $D$ over an algebraically closed field of characteristic 2. We construct a Springer correspondence for the Lie algebra of $G$. In particular, for orthogonal Lie algebras in…
Infinite population models are important tools for studying population dynamics of evolutionary algorithms. They describe how the distributions of populations change between consecutive generations. In general, infinite population models…
Let V be a variety of not necessarily associative algebras, and A an inverse limit of nilpotent algebras A_i\in V, such that some finitely generated subalgebra S \subseteq A is dense in A under the inverse limit of the discrete topologies…
This paper presents a novel approach to constructing finite generating sets for infinitely generated ideals. By integrating algebraic and computational techniques, we provide a method to identify finite generators, demonstrated through…