Dear GAP Forum,
I will be pleased if one can help in writing a program such that,
For a group $G$ (usually, a small group in GAP library), it computes the
subgroup generatedby the elements that are not left n-Engel, for some fixed n.
Recall that an element $a$ in $G$ is left n-Engel if it satisfies the
identity$[x,a,...,a]=1$, where $a$ occurs $n$ times (the commutator is left
normed).
Thanks in advance.Best,Yassine Guerboussa
_______________________________________________
Forum mailing list
Forum@mail.gap-system.org
http://mail.gap-system.org/mailman/listinfo/forum
