5,794
reputation
2
10
41

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.

132
answers
4
questions
~67k
people reached
  • Somewhere mostly harmless
  • Member for 2 years, 2 months
  • 561 profile views
  • Last seen 12 hours ago

Top tags (144)

Score 111
Posts 10
Posts % 7
Score 62
Posts 10
Score 45
Posts 20
Score 45
Posts 17
Score 35
Posts 17
Score 32
Posts 7

Top posts (136) All Questions Answers | Votes Newest

View all questions and answers

Badges (53)

Gold

2

Rarest

Silver

10

Rarest

Bronze

41

Rarest