G. Maxwell's user avatar
G. Maxwell's user avatar
G. Maxwell's user avatar
G. Maxwell
  • Member for 5 years, 3 months
  • Last seen more than a week ago
  • Somewhere mostly harmless
Stats
7,519
reputation
116k
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
18
silver badges
46
bronze badges
127
Score
10
Posts
7
Posts %
72
Score
10
Posts
7
Posts %
61
Score
23
Posts
16
Posts %
53
Score
18
Posts
13
Posts %
44
Score
7
Posts
5
Posts %
43
Score
17
Posts
12
Posts %
Top posts
View all questions and answers