Advertisements

- algorithm approximation bar binary binomial coefficients book cards carnival Carnival of Mathematics chocolate circle coins complex conjecture convolution counting decadic decimal diagrams Dirichlet Euclidean factorization fibonacci fractal game games gcd graph groups Haskell hyperbinary idempotent integers interactive irrational Ivan Niven Lagrange lehmer lucas MaBloWriMo making Mersenne moebius mu nim number numbers objects omega order pi powers prime primes primitive programming proof puzzle review roots sequence square strategy sum symmetry test tree triangular two-player unit unity video visualization X zero-sum
### Blogroll

### Fun

### Reference

### Categories

- algebra (46)
- arithmetic (63)
- books (29)
- calculus (7)
- challenges (53)
- combinatorics (12)
- complex numbers (6)
- computation (46)
- convergence (9)
- counting (32)
- famous numbers (48)
- fibonacci (18)
- fractals (13)
- games (34)
- geometry (56)
- golden ratio (8)
- group theory (26)
- humor (6)
- induction (7)
- infinity (19)
- iteration (24)
- links (74)
- logic (6)
- meta (41)
- modular arithmetic (24)
- number theory (76)
- open problems (11)
- paradox (1)
- pascal's triangle (8)
- pattern (92)
- people (21)
- pictures (70)
- posts without words (25)
- primes (35)
- probability (6)
- programming (17)
- proof (69)
- puzzles (15)
- recursion (16)
- review (20)
- sequences (28)
- solutions (28)
- teaching (14)
- trig (3)
- Uncategorized (6)
- video (19)

### Archives

- July 2017 (4)
- June 2017 (4)
- May 2017 (9)
- April 2017 (7)
- March 2017 (5)
- February 2017 (4)
- January 2017 (3)
- December 2016 (4)
- November 2016 (6)
- October 2016 (6)
- September 2016 (2)
- August 2016 (5)
- July 2016 (2)
- June 2016 (4)
- May 2016 (4)
- April 2016 (2)
- March 2016 (3)
- February 2016 (9)
- January 2016 (8)
- December 2015 (5)
- November 2015 (29)
- August 2015 (3)
- June 2015 (2)
- April 2015 (1)
- May 2014 (1)
- December 2013 (1)
- October 2013 (1)
- July 2013 (1)
- June 2013 (1)
- May 2013 (1)
- April 2013 (3)
- March 2013 (3)
- February 2013 (2)
- January 2013 (5)
- December 2012 (3)
- November 2012 (4)
- October 2012 (5)
- September 2012 (1)
- August 2012 (4)
- July 2012 (1)
- June 2012 (6)
- May 2012 (2)
- April 2012 (3)
- March 2012 (1)
- February 2012 (4)
- January 2012 (5)
- December 2011 (1)
- November 2011 (7)
- October 2011 (4)
- September 2011 (6)
- July 2011 (2)
- June 2011 (4)
- May 2011 (5)
- April 2011 (2)
- March 2011 (4)
- February 2011 (1)
- January 2011 (1)
- December 2010 (1)
- November 2010 (4)
- October 2010 (2)
- September 2010 (1)
- August 2010 (1)
- July 2010 (1)
- June 2010 (2)
- May 2010 (3)
- April 2010 (1)
- February 2010 (6)
- January 2010 (3)
- December 2009 (8)
- November 2009 (7)
- October 2009 (3)
- September 2009 (3)
- August 2009 (1)
- June 2009 (4)
- May 2009 (5)
- April 2009 (4)
- March 2009 (2)
- February 2009 (1)
- January 2009 (7)
- December 2008 (1)
- October 2008 (2)
- September 2008 (7)
- August 2008 (1)
- July 2008 (1)
- June 2008 (1)
- April 2008 (5)
- February 2008 (4)
- January 2008 (4)
- December 2007 (3)
- November 2007 (12)
- October 2007 (2)
- September 2007 (4)
- August 2007 (3)
- July 2007 (1)
- June 2007 (3)
- May 2007 (1)
- April 2007 (4)
- March 2007 (3)
- February 2007 (7)
- January 2007 (1)
- December 2006 (2)
- October 2006 (2)
- September 2006 (6)
- July 2006 (4)
- June 2006 (2)
- May 2006 (6)
- April 2006 (3)
- March 2006 (6)

### Meta

I will add a few words in a comment: the idea for this image came from Denis Moskowitz, who posted a link to an image he had made, http://suberic.net/~dmm/flower.png , and then explained it in more detail in some subsequent comments: https://mathlesstraveled.com/2017/03/30/post-without-words-13/#comment-27603 . I decided I wanted to try to make a version of the image that contained even more encoded information.

Wonderful! I had a feeling I had caught your interest. Personally I put the empty set in the center but doing the opposite is a clever solution of how to represent the “outer” point. 😀

Yeah, I realized that I switched it from your description, but of course the two are entirely dual. Putting the full set in the center made more sense to me for the purposes of actually drawing the sets, so it is dense in the middle and thinning out towards the edges of the diagram.

Also it’s interesting to see that it can work with circular arcs.

Yeah, I decided to try circular arcs since I wanted a simple rule that could generate all the edges automatically — I didn’t want to go through and position each class of edges by hand. In particular, when connecting points p and q, assuming p is farther from the origin, I always connect them using a circular arc which is tangent at p to the circle through p centered at the origin. (I spent a fun fifteen minutes drawing triangles and vectors and the law of sines etc. figuring out how to compute that.) Of course this also means that pairs of symmetric arcs coming out of a given node lie on the same circle, which looks nice. It’s not perfect—for example, the nodes in the second-to-last layer, with a pair of adjacent elements, have edges that cross just beneath / touching them, and I’d rather there was a little more clearance there—but overall it works pretty well.

That makes sense. My connections are straight lines in polar space – that is, the change in theta and the change in r are in proportion along the curve. (It’s actually 100 straight lines connecting the calculated points along that curve.)

Oh, fascinating! I didn’t realize there was a nice rule to describe your curves. I’ll have to try that too.

Well, I didn’t want to manually position edges either 🙂

Visualising the connected nature of all subset combinations is absolutely stunning. Thank you for creating this and sharing it.

It seems that the choices of set size, n, are limited. Obviously n = 2, 3 are straight forward and n = 5 works because C(5,1) = 5 and C(5,4) = 5 divide into C(5,2) = 10 and C(5,3) = 10. But for n = 4 you have the conflict of C(4,1) = 4 and C(4,2) = 6 and we lose rotational symmetry. Is there a rational choice that can be made to create a hexagon within a square (and similarly for other values of n) that has symmetry, even if it isn’t rotational? I guess it loses the elegance of this particular mapping.

We had a discussion of this in the last PWW comments. I think you might be able to make something similar with N-4 but a quick sketch makes me think it would be quite tangled. Would still love to see someone try!

I think that 2,3,5 are the only ones that would work. You want C(n,k) to be a multiple or factor of C(n,k+1) so that the kth and k+1st rings mesh. For this to happen, you need (n-k+1)/k to be an integer for k <= n/2. This means that k is a factor of n+1, whence the lcm of 1,…,n/2 (with floor function applied to n/2 if n odd) is n+1. Turning that around, we're looking for m such that lcm(1,…,m) divides 2m. But m and m-1 are coprime, so the lcm of 1,…,m is a multiple of (m-1)m. For m at least 4, this is at least 3m and we don't get a solution.

So we get three solutions, corresponding to m=1,2,3 with lcm(1,…,m) equal to 1,2,6. Noting that 1 divides 3, and 2 divides 4, gives the three solutions with n=2,3,5.

Back to the picture, what licence are you putting with it? I'd like to either print it off or (maybe) remix it to make a poster for my classroom. I think it's a great one for "What questions do you have?"

PS I think that n=11 is the next one with decent rotational symmetry. Only the k=5 ring will be out of step.

Ah, nice analysis. As for the license, everything on my blog is under a CC-BY-NC-3.0 license: https://mathlesstraveled.com/license/ . So you can definitely use it, remix it, etc. for your classroom. I agree it would be a great prompt to get students thinking and asking questions!

Thanks, glad you enjoyed it! I think I agree with Denis, there’s not really a good way to do n = 4 that works well. You can of course put a hexagon outside a square in a way that at least has some symmetry, but then the problem is that the edges don’t end up being symmetric.

After some doodling I’ve come up with the best compromise I could: it’s possible to make a very nice drawing for n=4 with fourfold rotational symmetry IF you are willing to duplicate two of the vertices. I’ll try to code it up so you can see what I mean. (Edited to add: it is now posted as PWW #15.)

For n larger than 5 it gets very complicated, I suspect there simply isn’t enough room in 2D (though I also wouldn’t be surprised if it turns out that there is an extremely nice layout for n = 24 or something crazy like that). It does raise the question of whether there are nice symmetric projections in other dimensions. I’m sure this has all been studied before, I think it really comes down to group theory.