Skip to main content

Timeline for Two groups acting on a set.

Current License: CC BY-SA 3.0

11 events
when toggle format what by license comment
S Jan 17, 2013 at 3:23 vote accept Maxime
Jan 17, 2013 at 3:23 vote accept Maxime
S Jan 17, 2013 at 3:23
Oct 8, 2012 at 23:46 vote accept Maxime
Jan 17, 2013 at 3:23
Mar 17, 2012 at 19:38 comment added Steven Landsburg Benjamin Steinberg: The vote to close was mine, for the reason given in my comment above. I see now that the question is both meaningful and interesting, though I continue to believe that the wording makes it unnecessarily obscure.
Mar 17, 2012 at 16:59 comment added Benjamin Steinberg I couldnt understand why this question has a vote to close and then by accident my stubby finger hit to vote to close when I was checking the reason. Sorry. This is a good question. I vote to undo my accidental vote.
Mar 17, 2012 at 14:57 answer added Derek Holt timeline score: 10
Mar 17, 2012 at 2:57 answer added user6976 timeline score: 8
Mar 17, 2012 at 2:49 comment added user6976 In fact the question asks for an algorithm of finding the intersection of two subgroups of $S_n$ (I assume the set to be finite). Each subgroup is given by generating permutations. I guess the problem is NP-hard (at least).
Mar 17, 2012 at 2:43 comment added user6976 @Steven: $H$ may coincide with $H'$ even if $G\ne G'$. In general $H$ and $H'$ can act with kernels $N, N'$ and the actions of $H/N$ and $H'/N'$ may coincide (i.e. these two permutation groups may be the same).
Mar 17, 2012 at 2:38 comment added Steven Landsburg I don't understand this question. We have two different groups $H$ and $H'$ acting on the same set $S$. What does it mean for these actions to "coinicide"?
Mar 17, 2012 at 2:33 history asked Maxime CC BY-SA 3.0