Anyone know a place where the standard Hall basis is listed up to at lest 5 fold brackets? and for gradedLie algebras?
The rules are clear but I'd rather not turn the crank myself. Google search did not get me there quickly.
Anyone know a place where the standard Hall basis is listed up to at lest 5 fold brackets? and for gradedLie algebras? The rules are clear but I'd rather not turn the crank myself. Google search did not get me there quickly. 


java application for calculations in free Lie algebra https://github.com/shma2001gmailcom/liefe/tree/master/src/main/java/org/misha 


These are easily obtained with SAGE:
Edit: And for the graded case, since the function which generates Lyndon words knows what a composition is, you can use the function
which find all positive solutions of $$\sum \lambda_i d_i=d$$ for a given $d$. Then for any given solution $L=[\lambda_1,\dots,\lambda_n]$ in the form of a Python list,
will return all the Lyndon words on $n$ letters containing exactly $\lambda_i$ times the $i$th letter. You'll get this way all Lyndon words of degree $d$. Warning: there is just a small issue: the LyndonWords function seems to have trouble with lists beginning by 0, so the code below use a modified function, see the end of this post... Example:
gives
Since Omar pointed this out, let me recall that standard bracketing of Lyndon words provides a Hall basis, maybe not "the" Hall basis you have in mind. If I'm not wrong, a Lyndon word o composition $(0,\dots,0,k_{j+1},\dots,k_n)$ with $j$ 0's at the beginning is the same as a Lyndon word of composition $(k_{j+1},\dots,k_n)$ with letters shifted by $j$ (since it has to be a Lyndon basis of the subLie algebra generated by $x_{j+1},\dots,x_n$. So hopefully the following code will do the trick:


