206
reputation
1
6

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.

2
answers
0
questions
~3k
people reached
  • Somewhere mostly harmless
  • Member for 1 year, 4 months
  • 28 profile views
  • Last seen Jun 21 at 18:14

Top tags (3)

Score 9
Posts 2
Score 5
Posts 1
Score 4
Posts 1

Top posts (2)

Badges (7)

Gold

Silver

1

Rarest

Bronze

6

Rarest