G. Maxwell
  • Member for 2 years, 8 months
  • Last seen this week
  • Somewhere mostly harmless
Stats
351
reputation
18k
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.

Badges
This user doesn’t have any gold badges yet.
2
silver badges
6
bronze badges
Top tags
13
Score
2
Posts
67
Posts %
9
Score
1
Posts
33
Posts %
9
Score
1
Posts
33
Posts %
7
Score
1
Posts
33
Posts %
6
Score
1
Posts
33
Posts %