Friday, April 22, 2016

regular polygons in rings, part two

In the last two posts, I was playing around with rings of polygons, relying on a formula developed in this post from last summer. I realize that the explanation offered in that original post was not so great, so I am going to try and better explain what the "regular polygon ring formula" k = 2n/(n -(2+2m)) means, and mention a few more interesting patterns.

The first thing to notice, is that some regular polygons can be fitted together nicely in a ring where there is one edge (along the interior of the ring) between adjacent polygons, like these:

And some regular polygons can be fitted together skipping over two edges along the interior, like these:

However, some regular polygons cannot be put into such arrangements for a given skip count.

So, a reasonable question to ask is which regular polygons can be arranged in a ring by skipping over a fixed number of edges. More precisely, can k regular n-gons be place in a ring formed by skipping over m edges (along the inside of the ring) between adjacent n-gons?

Before answering that, it is good to know a couple of things about angles in regular n-gons. The angles at the vertex of a regular n-gon is equal to (n-2)pi/n. A nice proof of this involves cutting the n-gon into triangles that all share one vertex of the original n-gon: (2-n) triangles each contribute a total angle measure of pi, which is then divided evenly among the n vertices of the original n-gon. Also, if you form a wedge in the n-gon, from its center to two adjacent vertices, the angle formed will be 2pi/n. These two angle facts will help us come up with formulas for which n-gons can form the rings described above.

Let's start with just skipping one edge (= 1) when forming the ring. Like for the pentagons shown below.

Consider k n-gons arranged in a ring so that there 1 side is skipped between adjacent polygons.

If you connect the centers of the k n-gons, you obtain a bigger interior polygon, a regular k-gon.

On the one hand, since it is a regular k-gon, its interior angles are (k-2)pi/k (the first fact about angles in regular polygons mentioned above). On the other hand, if you look at the angle as it sits within each n-gon, you can see that the angle is formed by connecting the midpoints of two sides, one side apart, to the center. From this, you can see that this angle is also equal to 4pi/n (from the second fact about angles in regular polygons mentioned above).

Equating these two gives you the rule k = 2n/(n-4).

We want k and n that are integers, so we can graph the function  k = 2n/(n-4) and see what works. If we choose n = 4, things are undefined, which corresponds in our geometric model to an infinite ring of squares:

The only actual solutions we get are for n equal to 5, 6, 8, and 12. After this k is approaching the limit of 2, which geometrically corresponds to the fact that you can't make a ring with just two polygons.

What if we skip over two edges?

Here again, you form a regular polygon by connecting the centers of the k n-gons.

Again, since it is a regular k-gon, it will have interior angles of (k-2)pi/k.

However, now looking at this angle within the n-gon you can see it is formed by connecting the midpoints of two sides, two sides apart, to the center. So the angle is also 6pi/n.

Equating (k-2)pi/k and 6pi/n  gives you the rule k = 2n/(n-6).

For the "skip 2 edges" case, if we choose n = 6, we get an infinite ring of hexagons, and our function  k = 2n/(n-6) is undefined.

We can find which polygons work by finding the integer solutions to our rule. There are six polygons that work following the skip 2 edges rule of ring construction, as shown on the graph below. We can stop at the 18-gon, with it we've hit the minimum value of k = 3.

In general, we can try a "skip m edges" rule, and following the same reasoning, and note that the angles of the central polygon will be (2 + 2m)pi/n (see diagram below). And, as before, equating this with (k-2)pi/k, obtain the relationship k = 2n/(n - (2 + 2m)).

This also covers the case m = 0, where we make a ring skipping zero edges fitting the regular n-gons snugly together, and find (as maybe you knew already) that this can only be done for the triangle, the square, and the hexagon.

Looking at the graphs and solutions for several values of m, it looks as if there are some linear relationships between n and k that hold true for all m.

Playing connect the dots, there about six relationships that jump out right away: three lines sloping upwards, and three horizontal constant relationships (a fixed value for k), that slice through each m curve and give integer solutions.

For example, consider the line k = 2n; when substituted into the general formula k = 2n/(n - (2 + 2m)), this gives us n = 2m + 3. What does this mean? One way of putting it is, for any number of skips (m) we can always find an n-gon that can form a ring that is twice the size of n. Or, put another way, for any odd n, you can place n-gons in a ring double the size of n, and to do this you will have to skip over m = (n-3)/2 sides. Six triangles can form a ring skipping no sides (m=0), 10 pentagons can form a ring skipping one side, and fourteen heptagons can form a ring skipping two sides.

Similarly, the line k = n connects with all the m curves when n = 2m + 4, so for any even n, you can place n n-gons in a ring (with m = (n - 4)/2 skips), as described in this post.

The other relationships mentioned above (and there are more that were not mentioned) also reveal interesting patterns in how rings of regular polygons can be formed. Some questions you can look at would be: What values n allow you to create a ring of 3, 4, or 6 n-gons? Which "skip values" allow you to create a ring of 10 polygons?