Stats
7,696
reputation
0
reached
0
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
View all badges
This user doesn’t have any gold badges yet.
6
silver badges
-
Yearling
× 6Jun 21
3
bronze badges
-
CriticOct 29, 2018
-
SupporterOct 29, 2018
-
AutobiographerJul 12, 2017
Posts
This user hasn’t posted yet.
Top network posts
View all network posts