As the title says: how can I find the subgroups of $S_n$? I know that $S_n = <(1 2), (1 2 .. n)>$ and $S_n = <(1 i): i = 2, 3, .. n>$. But how do I find all subgroups? And how do I know their orders?
Asked
Active
Viewed 108 times
0
-
E.g.: How to find all the subgoups of $S_3$ – amWhy Apr 11 '18 at 12:28
-
See also Is there any efficient algorithm for finding subgroups of a given finite group?, which addresses also, $S_n$, a finite group of size $n$. – amWhy Apr 11 '18 at 12:32
-
Wilson's "Finite Simple Groups" deals with the the subgroups of $S_n$ and much else of interest besides. https://www.amazon.co.uk/Finite-Simple-Groups-Graduate-Mathematics/dp/1848009879/ref=sr_1_6?s=books&ie=UTF8&qid=1523450390&sr=1-6&keywords=Finite+Simple+Groups – Mark Bennet Apr 11 '18 at 12:41
-
@amWhy I have voted to reopen this, because the specific $S_n$ case has been studied, and is more tractable, as you will see from the reference I posted in my other comment (check the index - there is a chapter on the problem - also coverage in Dixon and Mortimer "Permutation Groups"). I imagine the analysis would be a stretch for OP though - but an answer to the $S_n$ case would, I think, be valuable for the site. – Mark Bennet Apr 11 '18 at 12:47
-
@amWhy Further to above I see am=nother duplicate now listed, which does cover the case. – Mark Bennet Apr 11 '18 at 12:50
-
Yes, @MarkBennet I meant to close as the second you see listed, but still had the first on my clipboard (copied earlier for a comment). Hence I edited the primary target into the dupe-banner. – amWhy Apr 11 '18 at 13:07