An algorithm for computing graded algebras (Q1318850)

The author considers finite dimensional (non associative) graded algebras \(A=\bigoplus_{i=0}^ c A_ i\) over a field \(K\) that satisfy \(A_ k=\bigoplus_{k=i + j} A_ i A_ j\). If \(a_ 1,\ldots,a_ r\) forms a basis of the vector space \(A_ 1\) then \(A_ k\) is spanned by the products of these \(a_ i\) and \(A\) is generated by \(a_ 1,\ldots,a_ r\) as an algebra. A naturally ordered basis of \(A\) consisting of products is called a weighted product presentation. It is further supposed that the generators \(a_ 1,\dots,a_ r\) fulfill homogeneous relations, and if \(A\) satisfies an identical relation \(f(x,y,\dots)\) then it also satisfies all of its partial linearizations (e.g. substitute \(x + y\) for \(x\), \(y\) for \(y\) and expand). The set of identical relations is supposed to be finite. The author presents an algorithm to compute a weighted product representation of \(A/A^ d\) for \(d \in \mathbf N\) from one of \(A\). Now let \(A\) be associative. The Nagata-Higman theorem states that if \(A\) satisfies the identity \(x^ n=0\) then \(A\) is nilpotent. Kuzmin conjectured that its degree of nilpotency is \(n(n+1)/2\); this was proved for \(n=2,3\). The author gives a proof of this conjecture for \(n=4\) using its implementation of computation in algebras on a computer.