6,860
reputation
2
12
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.

137
answers
4
questions
~93k
people reached
  • Somewhere mostly harmless
  • Member for 3 years, 9 months
  • 754 profile views
  • Last seen Apr 3 at 1:28

Top tags (150)

Score 124
Posts 11
Posts % 8
Score 69
Posts 10
Score 62
Posts 25
Score 51
Posts 18
Score 42
Posts 18
Score 37
Posts 7

Top posts (141)

View all questions and answers

Badges (58)

Gold

2

Rarest

Silver

12

Rarest

Bronze

44

Rarest