G. Maxwell's user avatar
G. Maxwell's user avatar
G. Maxwell's user avatar
G. Maxwell
  • Member for 6 years, 8 months
  • Last seen this week
  • Somewhere mostly harmless
Stats
7,727
reputation
129k
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
20
silver badges
47
bronze badges
131
Score
10
Posts
7
Posts %
71
Score
10
Posts
7
Posts %
64
Score
23
Posts
16
Posts %
55
Score
18
Posts
13
Posts %
45
Score
7
Posts
5
Posts %
43
Score
17
Posts
12
Posts %
Top posts
View all questions and answers