Pinwheel Symmetry Formulas Exposed

  • Topic:
  • Thread starter mathjam0990
  • Start date
  • Tags Tags
    Color
5 replies · 3K views · last reply
mathjam0990
Messages
28
Reaction score
0
Question:

How many different pinwheels with 8 identically shaped pins are there if each pin can be colored one of 4 different colors?

My answer:

4^8 because each pin has 4 choices Is this correct? I think this only includes rotational symmetries. Do I need to consider reflectional symmetries? If so, would reflectional symmetries = 4^5?

Thank you for your help!
 
I'm not a specialist in combinatorics, but Wikipedia says the number is ${1\over 8}\sum_{d\mid 8}\varphi(d)4^{8/d}$.

By the way, how can a pinwheels spin if it has several pins? Do you mean 8 curls?
 
This is actually for an abstract algebra class. Not sure why they are teaching us combinatorics :( Also, I stated the question quote from our textbook so I am not sure. Thanks for the info though, I appreciate it.
 
mathjam0990 said:
This is actually for an abstract algebra class. Not sure why they are teaching us combinatorics :( Also, I stated the question quote from our textbook so I am not sure. Thanks for the info though, I appreciate it.

Because Burnside's lemma involves the use of group (action) theory.

Usually, we talk about "distinct colorings"; for example, if we have for the "pins":

1 = red
2 = yellow
3 = green
4 = blue
5 = red
6 = yellow
7 = green
8 = blue

this is regarded as the same coloring as:

1 = yellow
2 = green
3 = blue
4 = red
5 = yellow
6 = green
7 = blue
8 = red

since the $8$-cycle $(1\ 2\ 3\ 4\ 5\ 6\ 7\ 8)$ takes the first to the second (that particular $8$-cycle generates the rotation group).

$4^8$ is the size of the total "configuration space" $X$ of all possible colorings where we keep track of which "pin" got painted what color. The number of "distinct colorings" is much smaller, since we might rotate one configuration into another, with no way to tell them apart (this assumes all eight "pins" are identical).

I daresay a pinwheel is being used here to avoid the harder question of including reflection symmetries (like you would have using a necklace, with beads).
 
Thank you Deveno for your help. The question in the book definitely stated quote pinwheel. I think it's a poorly written book and a bit ambiguous at times which doesn't help someone like me who is already not too great at this stuff. Anyway, thanks for the info!
 
Attachments
  • Handwritten-style typeset proof of Burnside's Lemma: the number of orbits of a permutation group G on a finite set equals the average number of fixed points, (1/|G|) times the sum over g in G of |Omega_g|.
    MHBgroups5a.png
    12.7 KB · Views: 140
  • Handwritten mathematical proof on a permutation group G acting on a set S of strings, establishing that c(g^k) = (n, k) for an n-cycle g, with Lemma 1 on the size of the fixed set S_g.
    MHBgroups5b.png
    18.9 KB · Views: 126
  • Typeset proof page with two numbered results: (1) the necklace formula N(n,a) = (1/n) times the sum over divisors d of n of phi(d) a^(n/d), with a proof via Burnside's lemma; (2) the bracelet formula B(n,a) with cases for odd and even n.
    MHBgroups5c.png
    14.3 KB · Views: 130
  • Handwritten proof text on lined paper, with derivations of the number of orbits B(n, a) using Burnside's lemma, splitting into cases for n odd and n even.
    MHBgroups5d.png
    11.9 KB · Views: 142