G. Maxwell
  • Somewhere mostly harmless
  • Member for 4 years, 3 months
Stats
7,199
reputation
102k
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

Top tags (155)

Score 125
Posts 11
Posts % 8
Score 69
Posts 10
Score 62
Posts 24
Score 51
Posts 18
Score 43
Posts 18
Score 42
Posts 7

Top posts (143)

View all questions and answers