Decomposable Families of Shapes

There are two types of golden triangles in the world, as shown in the following picture:

Here $\varphi = \dfrac{1+\sqrt{5}}{2}$ denotes the golden ratio. Each of these golden triangles can be decomposed into two smaller golden triangles in two different ways:

(More generally, if we fix a natural number $n \geq 5$, then the set of all similarity classes of triangles whose angles are multiples of $\pi/n$ has a similar property. The golden triangles are the case where $n=5$.)

In general, we say that a finite family of (similarity classes of) polygons is decomposable if each polygon in the family can be decomposed into two polygons from the family in at least two different ways.

So here are my questions:

1. What are some other decomposable families of polygons?

2. Does this property (or something similar) already have a name in the literature? Where can I look this up?

3. Are there any decomposable families of shapes in the plane whose members are not polygons? For example, do there exist any finite decomposable families of fractal shapes?

4. Are there any decomposable families of polyhedra in $\mathbb{R}^3$?

Motivation: I have an interesting way of making an infinite discrete group associated to any decomposable family, and I want more examples of such groups.

-
You may be aware of this, but there's a concept of "rep-tile" or "self-replicating tile": a single polygonal shape that can be decomposed into smaller similar copies of itself. – Blue Oct 30 '13 at 15:49
I suppose it's a matter of taste, but I'd consider your "two different ways" of decomposing the golden triangles to be equivalent (since there's an isometry between them). Also, the "at least two different ways" condition seems unnecessarily restrictive. Why not simply require that a given polygon in the family be decomposable into other members of the family, period? I might suggest, to dismiss trivial families of rep-tiles, requiring that the decomposition of a member of one similarity class involve at least one member of at least one other similarity class. (Or something to that effect.) – Blue Oct 30 '13 at 16:01
I suspected you had your reasons. :) BTW: The Wikipedia article mentions that Lee Sallows generalized rep-tiles to "self-tiling tile sets"; here's the JSTOR link. – Blue Oct 30 '13 at 16:18
I would be very interested to see how you manage to get groups from such decompositions. Would you mind perhaps outlining the method/definitions in your question? (Only if it's not too much trouble of course). – Dan Rust Nov 6 '13 at 2:30
Interestingly, I just asked a similar question a week ago: math.stackexchange.com/questions/544157/… – Erel Segal-Halevi Nov 6 '13 at 10:51

While the below might not perfectly match the criteria in your question, I think it should give you a decent insight in to the kinds of examples which are very closely related to the one you give as an example. There are simply too many examples to check to see which satisfy your stated conditions so I'll just give you a foothold on where to begin your search, as well as a slight exposition of aperiodic tilings. I apologise if this is too much of a tangent from your specific question.

The example you give is actually a generating substitution for (one of the representations of) the Penrose tiling - specifically the Robinson triangles prototile set - here is a very good video which outlines some of the methods that these tiles can be fit together to tile the plane (as well as the other representations of the Penrose tiling). The specific property you mention is related to the notion of a substitution tiling. The tiling associated to the particular substitution in your example looks something like this after a few dozen iterations.

You'll notice that the portion of the tiling shown here isn't periodic (and in fact it can be shown that there is no translation which maps the tiling of the plane to itself), and yet each local region can be found infinitely often through the plane, and within a bounded distance of each occurance. We call such a tiling aperiodic.

Substitution tilings (a sub-branch of the broader theory of aperiodic tilings) are very well studied and an extremely active area of research at the moment; bringing together areas of mathematics such as combinatorics, decidability theory (logic), dynamical systems, non-commutative geometry, mathematical physics, and my current focus - algebraic topology.

I'll answer your fourth question first as it's the easiest - Yes there are substitution tilings in higher dimensions, and even in non-Eucliden spaces such as hyperbolic space. A good place to start would be the work of Chaim Goodman-Strauss - especially for such wonderful images as 'dodecafoam'.

The next easiest is your third question - yes there are fractal substitution tilesets for the plane. In fact, you can cut out little fractal Koch snowflake-like tabs on one of the edges of any polygonal tileset and glue it on to the corresponding edge of the tile(s) that that edge can appear next to after substituting. In terms of pictures, there are also of course the famous Rauzy Fractals

although I don't think this quite satisfies your conditions (I could be wrong).

For some solid examples in the plane that you might like to start with, there's

As well as the half-hex tiling, the sphinx tiling, the table tiling, the Ammann-Beenker tiling, the pinwheel tiling, and many more which you can find in the literature by searching in the areas of aperiodic tilings and substitution tilings.

-
Thanks for this fantastic answer! I'm not sure that any of the examples that you've mentioned actually satisfy the criteria that I've requested, but you've certainly given me lots of useful ideas as well as some indication of where to look in the literature. – Jim Belk Nov 10 '13 at 0:54

Consider the following family of 4 similarity classes: squares, 1-by-2 rectangles, 1-by-3 rectangles, and 1-by-4 rectangles. Each polygon in the family can be decomposed into two polygons from the family in at least two different ways:

• squares can be decomposed to two 1-by-2 rectangles either horizontally or vertically.
• 1-by-2 rectangles can be decomposed to two squares vertically, or to two 1-by-4 rectangles horizontally.
• 1-by-3 rectangles can be decomposed vertically to a square and a 1-by-2 rectangle, or vice versa.
• 1-by-4 rectangles can be decomposed vertically to a square and a 1-by-3 rectangle, or vice versa, or two 1-by-2 rectangles.

This set can be extended arbitrarily by adding 1-by-N rectangles for every integer $N\geq 5$. This can also be extended to polyhedra in $R^3$, by making each rectangle a hypercuboid of size 1-by-1-by-N.

Another family, which I describe in the same way I built it (hopefully this will some day develop into an algorithm):

• Take a right-angled isosceles triangle (RAIT). Cut it using the perpendicular bisector to one of its shorter sides. The result is a smaller RAIT, and a right-angled quadrilateral (trapezoid). This can be done in two ways (one for each shorter-side).
• Take the trapezoid. Cut it to two RAITs of different sizes. Cut it in another way, to a square and a RAIT.
• Take the square. Cut it to two RAITs in two ways (one for each diagonal).

In conclusion, we have a family of 3 decomposable shapes: RAIT, trapezoid and square.

So, currently we have a family of 2 decomposable shapes (in the OP), a family of 3 (above) and families of 4 or more (above the above).

-
Thanks for these examples! It seems likely that both of these lead to groups of the type that I am studying. – Jim Belk Nov 10 '13 at 1:00
Apparently I can't award two bounties for the same question, so I'm awarding you a +100 bounty for your answer to this question. – Jim Belk Nov 10 '13 at 1:08
@JimBelk Thank you! Glad to have helped. – Erel Segal-Halevi Nov 11 '13 at 7:11