# Abstract Algebra: Burnside's Counting Theorem

Please see the attached file for full problem description.

A bead is placed at each of the six vertices of a regular hexagon, and each bead is to be painted either red or blue, how many distinguishable patterns are there under equivalence relative to the group of rotations of the hexagon?

Repeat Problem 8 with a regular hexagon in place of a regular pentagon.

In how many distinguishable ways can the four faces of a regular tetrahedron be painted with four different colors if each face is to be a different color and two ways are considered indistinguishable if one can be obtained from the other by rotation of the tetrahedron? (The group of rotations in this case has order 12. In addition to the identity, there are eight 120? Rotations around lines such as are in the following figure, and three 180? Rotations around lines such as fg.)

Use Burnside?s Counting Theorem to compute the number of orbits for the group 〈(1 2 3 4)(5 6)〉acting on {1, 2, 3, 4, 5, 6}. What are the orbits?

© BrainMass Inc. brainmass.com October 10, 2019, 4:36 am ad1c9bdddfhttps://brainmass.com/math/combinatorics/abstract-algebra-burnsides-counting-theorem-469165

#### Solution Preview

Please see the attached file.

8) Let G be the group of rotations of regular hexagon. We know that it contains 6 elements .

Let X be the set of all colored patterns. It is obvious that X contains 26=64 elements.

The group G acts on X as follows. To any rotation α and a colored pattern P we assign the pattern obtained from P by the rotation of the regular hexagon by α. The number of distinguishable patterns under the equivalence relative to the group of rotations is equal to the number of orbits. We will use the Burnside's counting theorem. To this end we need to find the number of fixed elements ...

#### Solution Summary

The solution discusses abstract algebra specifically the Burnside's Counting Theorem.