Primitive elements of free nonassociative algebras (Q1037168)

The authors study free nonassociative algebras \(F(X)\). The paper is a continuation of previous works [\textit{K. Champagnier}, ``Algorithms for realizing the rank and primitivity of systems of elements in free nonassociative algebras'', Fundam. Prikl. Mat. 6, No. 4, 1229--1238 (2000; Zbl 1087.17502); \textit{A. A. Mikhalev, U. Umirbaev} and \textit{J.-T. Yu}, ``Automorphic orbits in free non-associative algebras'', J. Algebra 243, No. 1, 198--223 (2001; Zbl 1021.17003)]. A system of elements of the algebra \(A\) is said to be \textit{primitive} if it is a subset of some set of free generators of \(A\). As a main result the authors obtain an improved algorithm to construct complements of primitive systems of elements of free nonassociative algebras with respect to free generating sets and algorithms to realize the rank of a system of elements.