People who code: we want your input. Take the Survey
7,013
reputation
2
13
44

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.

138
answers
4
questions
~97k
people reached
  • Somewhere mostly harmless
  • Member for 3 years, 11 months
  • 776 profile views
  • Last seen 6 hours ago

Top tags (152)

Score 124
Posts 11
Posts % 8
Score 69
Posts 10
Score 59
Posts 24
Score 51
Posts 18
Score 42
Posts 18
Score 40
Posts 7

Top posts (142)

View all questions and answers

Badges (59)

Gold

2

Rarest

Silver

13

Rarest

Bronze

44

Rarest