G. Maxwell
  • Somewhere mostly harmless
  • Member for 2 years, 6 months
Stats
351
reputation
17k
reached
3
answers
0
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.

This user doesn’t have any gold badges yet.
2
silver badges
6
bronze badges

Top tags (5)

Score 13
Posts 2
Score 9
Posts 1
Score 9
Posts 1
Score 7
Posts 1
Score 6
Posts 1

Top posts (3)