06.09.2021 Views

Combinatorics Through Guided Discovery, 2004a

Combinatorics Through Guided Discovery, 2004a

Combinatorics Through Guided Discovery, 2004a

SHOW MORE
SHOW LESS

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

120 6. Groups acting on sets<br />

Problem 290. Complete the proof of Theorem 6.2.3.<br />

Notice that thinking in terms of orbits actually hides some information about<br />

the action of our group. When we computed the multiset of all results of acting on<br />

{1, 2} with the elements of D 4 , we got an eight-element multiset containing each<br />

side twice. When we computed the multiset of all results of acting on {1, 3} with<br />

the elements of D 4 , we got an eight-element multiset containing each diagonal of<br />

the square four times. These multisets remind us that we are acting on our twoelement<br />

sets with an eight-element group. The multiorbit of G determined by an<br />

element x of S is the multiset<br />

{σ(x) | σ ∈ G},<br />

and is denoted by Gx multi .<br />

When we used the quotient principle to count circular seating arrangements or<br />

necklaces, we partitioned up a set of lists of people or beads into blocks of equivalent<br />

lists. In the case of seating n people around a round table, what made two lists<br />

equivalent was, in retrospect, the action of the rotation group C n . In the case of<br />

stringing n beads on a string to make a necklace, what made two lists equivalent<br />

was the action of the dihedral group. Thus the blocks of our partitions were orbits<br />

of the rotation group or the dihedral group, and we were counting the number of<br />

orbits of the group action. In Problem 45, we were not able to apply the quotient<br />

principle because we had blocks of different sizes. However, these blocks were still<br />

orbits of the action of the group D 4 . And, even though the orbits have different<br />

sizes, we expect that each orbit corresponds naturally to a multiorbit and that the<br />

multiorbits all have the same size. Thus if we had a version of the quotient rule for<br />

a union of multisets, we could hope to use it to count the number of multiorbits.<br />

Problem 291.<br />

(a) Find the orbit and multiorbit of D 4 acting on the coloring<br />

{(1, R), (2, R), (3, B), (4, B)},<br />

or, in standard notation, RRBB of the vertices of a square.<br />

(b) How many group elements map the coloring RRBB to itself? What is<br />

the multiplicity of RRBB in its multiorbit?<br />

(c) Find the orbit and multiorbit of D 4 acting on the coloring<br />

{(1, R), (2, B), (3, R), (4, B)}.<br />

(d) How many elements of the group send the coloring RBRB to itself?<br />

What is the multiplicity of RBRB in its orbit?

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!