whauk
Veteran
so every finite group (with less than n+1 elements) is isomorphic to a subgroup of the symmetric group Sn. (http://en.wikipedia.org/wiki/Cayley's_theorem)
however we dont need n to be ~10^18 to find the cube group as a subgroup in it.
my current upper and lower bounds for n are:
upper bound: 48 because the cube group actually just cycles 48 stickers around. => permutation group of 48 elements suffices (=S48)
lower bound: 23 because there is an element of order 2*3*7*11(=462) namely a 11-cycle of edges with a 7 cycle of corners, a flipped edge and a twisted corner. so the smallest possible Sn to contain this must contain an 11-,7-,3- and 2-cycle simultaneously. and the sum of these numbers is 23. also 23! which is the order of S23 is already greater than the order of the cube group.
this is all i get from ~20 minutes of thinking. can anyone improve these boundaries?
however we dont need n to be ~10^18 to find the cube group as a subgroup in it.
my current upper and lower bounds for n are:
upper bound: 48 because the cube group actually just cycles 48 stickers around. => permutation group of 48 elements suffices (=S48)
lower bound: 23 because there is an element of order 2*3*7*11(=462) namely a 11-cycle of edges with a 7 cycle of corners, a flipped edge and a twisted corner. so the smallest possible Sn to contain this must contain an 11-,7-,3- and 2-cycle simultaneously. and the sum of these numbers is 23. also 23! which is the order of S23 is already greater than the order of the cube group.
this is all i get from ~20 minutes of thinking. can anyone improve these boundaries?