Abstract:
Let $M(A)$ be a free metabelian Lie algebra with a finite generating set $A$ over an algebraically closed field $F$ of characteristic zero, in which the problem of there being solutions to a system of linear equations is decided algorithmically, and let $M'(A)$ be the derived subalgebra of $M(A)$. We present an algorithm for finding width of elements in $M'(A)$.
Keywords:free metabelian Lie algebra, width of element in derived algebra, equation, solvability.