> < ^ From:

> ^ Subject:

Dear Gap Forum,

I am looking for an algorithm(s) that would enumerate

a permutation group (from a set of genrators) such

that each element of the

group is represented as a product of the disjoint permutations

(which would be from the set of the generators).

That is if each element pi of the group G is represented as

pi = g1*g2* ... gr ,

(where r is clearly a polynomial in the degree of the group),

then g1,g2, .. gr are mutually disjoint.

Here the size of set of generators could be a polynomial in r.

Clearly, it is not important whether the generators are strong are not.

Hope to receive some references in this direction.

Thanking you all.

-- ================================================= Javaid Aslam jaslamx@ichips.intel.com Architecture Validation Tools, Intel Corp. MS AL4-51 Location : AL4 2nd. Floor (near N5). Office Phone : 503-591-4735 Fax: 503-591-4862

> < [top]