G. Maxwell
  • Member for 4 years, 5 months
  • Last seen this week
  • Somewhere mostly harmless
Stats
7,239
reputation
104k
reached
139
answers
4
questions
Loading…
About

My profile image is a constructive proof that all possible dyadic paritionings of a square cannot be enumerated by an algorithm that recursively partitions by halves horizontally or vertically. Any such solution will contain a strut (a line going all the way across), and the image is strutless. In fact, this image illustrates both of the only two strutless solutions when dividing down to 1/4 (ignoring rotations and reflections). I am the sort of person who finds this interesting.

2
gold badges
14
silver badges
44
bronze badges
125
Score
11
Posts
8
Posts %
69
Score
10
Posts
7
Posts %
62
Score
24
Posts
17
Posts %
52
Score
18
Posts
13
Posts %
43
Score
18
Posts
13
Posts %
42
Score
7
Posts
5
Posts %