> < ^ From:

< ^ Subject:

>

> Tim Hsu writes in his e-mail article of 1994/04/13

>

> Hi. I would like to be able to do the following thing: I have a

> presentation of a finite group G, and I would like to be able to know,

> say, the 100 "shortest" ways of expressing a word in the generators

> which represents the identity in G as a product of conjugates of

> relators. Is this easy to do in GAP? If not, do you know of another

> program which does this?

>

I'd guess that one has to measure that length as the number of relators

involved, is it correct?

I believe there are efficient algorithms which solve a simpler "abelianized"

problem, i.e. giving the answers modulo $G'$.

Dima

> < [top]