## Rubik’s Cube Wrapup

I want to tie up a few loose ends about Rubik’s group today.

We can fit Rubik’s group into a sequence that more clearly shows all the structure I’m talking about. Specifically, it’s a subgroup of the bigger group I mentioned back at the beginning. We can restate the three restrictions as saying the maneuvers in Rubik’s group are those in the kernel of a certain homomorphism. So, first let’s write down the big group.

The unrestricted edge and corner groups are just wreath products, which I’ll write out as semidirect products. Without restrictions, these two groups are independent, so we just have a direct product to give the unrestricted Rubik’s group.

I’ll write for a generic element of this group. Each part of this list corresponds to part of the expression for above.

Now we want to add up all the edge flips and make them come out to zero. We can write this sum as a homomorphism:

where the sum is taken in the group . You should be able to verify that this actually is a homomorphism. Similarly, we want the sum of the total twists as a homomorphism:

where the sum is taken in .

Finally, the permutation condition uses the “signum” homomorphism from a symmetric group to . It assigns the value to even permutations and the value to odd ones. We use it to write the last restriction as a homomorphism:

Now we assemble our overall restriction homomorphism as the direct product of these three:

and get the short exact sequence:

Commenter Dan Hoey brought up where my fundamental operations come from. To be honest, these four are just ones I remember off the top of my head. He’s right, though, that there are systematic ways of coming up with maneuvers that perform double-flips, double-twists, and -cycles. I’ll leave you to read his comment and work out yourself that you can realize four such basic maneuvers as commutators — products of elements of the form . This means that the commutator subgroup of Rubik’s group is *almost* all of itself. It just misses a single twist. In fact, — Rubik’s group is *highly* non-abelian.

Incidentally, this approach to the cube is not the first one I worked out, but it’s far more elegant than my pastiche of particular tools. I picked it up back when I was at the University of Maryland from a guy who had worked it out while *he* was at Yale as a graduate student back when the cube first came out: Jeff Adams.

Maybe this is a little late for this entry but you might like to know that 5 students at Carinthia University of Applied Sciences in Austria built a completely automated system that solves the Rubik Cube puzzle in fewer than 26 moves in less than 2 minutes. The system looks at the cube with a camera, processes data, runs solving algorithm, and uses mechanical grippers to make the moves.

Comment by Steve Myers | March 30, 2007 |

[…] important representation I haven’t mentioned. Well, actually, I mentioned it in passing while talking about Rubik’s group, but not very explicitly. And it’s a very important […]

Pingback by The Signum Representation « The Unapologetic Mathematician | December 18, 2008 |