2. Escher Counts

Consider the rotations-only case for a moment (case 1) and consider the question of how many truly different signatures there are. Two signatures are considered equivalent when they yield congruent tilings for all motifs. Naively, there are [Graphics:../Images/index_gr_23.gif], or 256 signatures, since each position can hold one of 4 instructions. But of course any signature is equivalent to one with a “1” in the upper-left corner. So there are at most 64 distinct tilings. But many of the 64 signatures yield congruent tilings. For example,  [Graphics:../Images/index_gr_24.gif] is equivalent to [Graphics:../Images/index_gr_25.gif] via a 90° rotation.

[Graphics:../Images/index_gr_26.gif]

[Graphics:../Images/index_gr_27.gif]

Figure 5. The signature [Graphics:../Images/index_gr_28.gif] yields a tiling that is congruent (by a 90° rotation) to that obtained from [Graphics:../Images/index_gr_29.gif], shown in Figure 3.

It turns out that there are exactly 23 nonequivalent signatures. Escher knew this and made a complete compilation of the 23 tilings. A detailed explanation of the counting techniques that can be used to prove that 23 is correct can be found in [Schattschneider, 1997]. Table 1 shows the complete list (available in the package as EscherList).

[Graphics:../Images/index_gr_30.gif] [Graphics:../Images/index_gr_31.gif] [Graphics:../Images/index_gr_32.gif] [Graphics:../Images/index_gr_33.gif] [Graphics:../Images/index_gr_34.gif] [Graphics:../Images/index_gr_35.gif]
[Graphics:../Images/index_gr_36.gif] [Graphics:../Images/index_gr_37.gif] [Graphics:../Images/index_gr_38.gif] [Graphics:../Images/index_gr_39.gif] [Graphics:../Images/index_gr_40.gif] [Graphics:../Images/index_gr_41.gif]
[Graphics:../Images/index_gr_42.gif] [Graphics:../Images/index_gr_43.gif] [Graphics:../Images/index_gr_44.gif] [Graphics:../Images/index_gr_45.gif] [Graphics:../Images/index_gr_46.gif] [Graphics:../Images/index_gr_47.gif]
[Graphics:../Images/index_gr_48.gif] [Graphics:../Images/index_gr_49.gif] [Graphics:../Images/index_gr_50.gif] [Graphics:../Images/index_gr_51.gif] [Graphics:../Images/index_gr_52.gif]

Table 1. Escher’s 23 signatures that yield, up to congruence, all tilings using only rotations.

EXERCISE.  How many of these 23 signatures are unique in that they admit no other equivalent signature (with a 1 in the upper-left corner)?

When including flips (case 2) it is important to note that Escher found some restrictions useful in generating aesthetically pleasing patterns. He always used the restriction to the case of two rotations and two flips. Moreover, he either used signatures so that the two rotations are the same, as are the two flips (case 2A; e.g., [Graphics:../Images/index_gr_53.gif]), or he insisted that the the two rotations not be the same and the two flips not be the same (case 2B; e.g.,  [Graphics:../Images/index_gr_54.gif]). See Table 2, below.



[Graphics:../Images/index_gr_55.gif] [Graphics:../Images/index_gr_56.gif] [Graphics:../Images/index_gr_57.gif]
[Graphics:../Images/index_gr_58.gif] [Graphics:../Images/index_gr_59.gif] 23 23
[Graphics:../Images/index_gr_60.gif]
[Graphics:../Images/index_gr_61.gif] [Graphics:../Images/index_gr_62.gif] 154
[Graphics:../Images/index_gr_63.gif] [Graphics:../Images/index_gr_64.gif] 67
[Graphics:../Images/index_gr_65.gif] [Graphics:../Images/index_gr_66.gif] 10 10
[Graphics:../Images/index_gr_67.gif] [Graphics:../Images/index_gr_68.gif] 39 36

Table 2. This summarizes what is known about the number of different patterns.

It is a dizzying task to examine by hand all the possibilities and determine which are equivalent. Thus it is not surprising that not all Escher’s counts are perfect. He missed three in case 2B (see Figure 6).

[Graphics:../Images/index_gr_69.gif]

[Graphics:../Images/index_gr_70.gif]

Figure 6. Escher’s count of a certain type of pattern was 36 when there are really 39. These three are the ones he missed (see [Schattschneider 1997]).


Converted by Mathematica      July 21, 1999