Recursive structure conjecture for extremal polyominoes

Let PP be a dd-dimensional polyomino with parameters l1,,ldl_1,\dots,l_d and v1,,vdv_1,\dots,v_d, and suppose that the convex hull of PP has maximum volume. Let PP' be a subpolyomino of PP. Recursive structure conjecture. The parameters satisfy v1==vd=0v_1=\dots=v_d=0, and PP' can be chosen so that: (i) PP' has height 11 in the direction of axis ii; (ii) the projection of PP' along axis ii also has maximal convex-hull volume and parameters l1,,li1,li+1,,ldl_1,\dots,l_{i-1},l_{i+1},\dots,l_d; and (iii) PP can be decomposed into PP' and at most two orthogonal linear arms. This describes a recursive structure for maximizers, although the surrounding proof of the main theorem suggests that the assertion may already follow from established arguments in the paper.

Sources & referencesView supporting material

Primary source

Sascha Kurz, “Convex hulls of polyominoes”, arXiv:math/0702786 (2007).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.