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.

6.2. Groups Acting on Sets 117<br />

1 2<br />

R R<br />

B B<br />

4 3<br />

Figure 6.2.2: The colored square with coloring {(1, R), (2, R), (3, B), (4, B)}<br />

This gives us an explicity list of which colors are assigned to which vertex.4<br />

Then if we rotate the square through 90 degrees, we see that the set of ordered<br />

pairs becomes {<br />

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

}<br />

(6.2)<br />

which is the same as<br />

Or, in a more natural order,<br />

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

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

The reordering we did in (6.3) suggests yet another simplification of notation. So<br />

long as we know we that the first elements of our pairs are labeled by the members<br />

of [n] for some integer n and we are listing our pairs in increasing order by the first<br />

component, we can denote the coloring<br />

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

by BRRB. In the case where we have numbered the elements of the set S we are<br />

coloring, we will call this list of colors of the elements of S in order the standard<br />

notation for the coloring. We will call the ordering used in (6.3)the standard<br />

ordering of the coloring.<br />

Thus we have three natural ways to represent a coloring of a set: as a function,<br />

as a set of ordered pairs, and as a list. Different representations are useful for<br />

different things. For example, the representation by ordered pairs will provide a<br />

natural way to define the action of a group on colorings of a set. Given a coloring<br />

as a function f , we denote the set of ordered pairs<br />

{ }<br />

(x, f (x)) | x ∈ S ,<br />

suggestively as (S, f ) for short. We use f (1) f (2) ··· f (n) to stand for a particular<br />

coloring (S, f ) in the standard notation.<br />

Problem 284. Suppose now that instead of coloring the vertices of a square,<br />

we color its edges. We will use the shorthand 12, 23, 34, and 41 to stand for<br />

the edges of the square between vertex 1 and vertex 2, vertex 2 and vertex<br />

4The reader who has studied Appendix A will recognize that this set of ordered pairs is the relation<br />

of the function f , but we won’t need to make any specific references to the idea of a relation in what<br />

follows.

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

Saved successfully!

Ooh no, something went wrong!