> < ^ From:

> ^ Subject:

Dear GAP-forum,

is there a function in GAP 3.2 that takes a sequence of AG-words and

applies the non-commutative Gauss algorithm to it? Checking the

manual and browsing through the source code didn't reveal one. I know

about the function Cgs(). Cgs() does more than I need because it also

closes the generating system under conjugates/commutators and powers.

The function that I have in mind just computes the `row-echelon form'

for the given sequence of AG-words.

With kind regards, Werner Nickel.

----------------------------/|-|--|-|--|------Werner-Nickel------------------- werner@pell.anu.edu.au /_| |\ | | | Mathematics Research Section --------------------------/--|-|-\|-|_/|------Australian-National-University--

> < [top]