[GAP Forum] Generating the total number of distinct permutations in the set UG

[Bulutoglu Dursun A Civ AFIT/ENC]

	Dear Gap Forum,
	I solved my problem. The solution is as follows.
	Group U acts on G by left multiplication sending cosets of G to
cosets of G. I am looking for the order of the orbit of G under the
action of U. This is simply |U|/(U intersect G). I used the function
Intersection in GAP to compute (G intersect U)

-----Original Message-----
From: forum-bounces at gap-system.org [mailto:forum-bounces at gap-system.org]
On Behalf Of Bulutoglu Dursun A Civ AFIT/ENC
Sent: Saturday, July 31, 2004 4:07 PM
To: forum at gap-system.org
Subject: [GAP Forum] Generating the total number of distinct
permutations inthe set UG 

	Dear Gap Forum;
	I was able to generate two permutation groups U and G in GAP.  U
has order 480 and G has order 185794560. Let elements of U be u_1, u_2,
...u_480. I am interested in the cosets u_1G, u_2G,...u_480G. I would
like to be able to compute the number of distinct such cosets of G.
(Here there may be repeated cosets.) I was wondering how I could do this
efficiently in GAP. I would very much appreciate the help.
	Dursun.
_______________________________________________
Forum mailing list
Forum at mail.gap-system.org
http://mail.gap-system.org/mailman/listinfo/forum