G. Maxwell
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.
137
answers
4
questions
~90k
people reached
-
Somewhere mostly harmless
-
Member for 3 years, 8 months
-
742 profile views
-
Last seen Feb 26 at 2:30
Communities (6)
Top network posts
Badges (57)
Gold
2
Rarest
-
Dec 27 '18
-
Feb 11 '19
Silver
12
Rarest
-
Jan 25 '19
-
Nov 17 '18
-
Oct 18 '18
Bronze
43
Rarest
-
Nov 17 '18
-
Jan 24 '19
-
Jan 24 '19