View Single Post
  #1  
Old December 14th, 2008, 11:43 PM
aliceinwonderland aliceinwonderland is offline
Senior Member
 
Join Date: Nov 2008
Posts: 260
Thanks: 48
Thanked 98 Times in 90 Posts
aliceinwonderland has a spectacular aura aboutaliceinwonderland has a spectacular aura about
Default G-sets to counting

Wooden cubes of the same size are to be painted a different color on each face to make children's blocks. How many blocks can be made if eight colors of paint are available? Colors may be repeated on different faces at will. Use Burnside's formula and define G for rigid motions.

--------------------------------------------------------------------------
My attempt to this problem so far

According to the application of wiki page of Burnside's lemma,

|G| = 24

One identity element which leaves all 8^{6} elements of X unchanged.
Six 90-degree face rotations, each of which leaves 8^{3} unchanged.
Three 180-degree face rotations, each of which leaves 8^{4} unchanged.
Eight 120-degree vertex rotations, each of which leaves 8^{2} unchanged. (If we give numbers for each side like 1-bottom 6-top 2-front 5-back 3-left 4-right, eight choices of same colors for 1,3,5 and eight choices of same colors for 2,4,6. )

Six 180-degree edge rotations, each of which leaves 8^{3} unchanged.

My question is

What is the "six 180-degree edge rotations" (hard to figure out) and what choices of colors should be given for "six 180-degree edge rotations" if we temporarily gives numbers (1,2,3,4,5,6) like above for each side?

Last edited by aliceinwonderland; December 15th, 2008 at 05:02 AM.
Reply With Quote