Sharpness conjecture for the crystallized 2k,3-polyform bound
Statement
Let be an integer. Let be an extremal -polyform with tiles, let be the associated -polyform, and let denote the minimum perimeter among -polyforms with tiles. A polyform is crystallized when it attains the minimum possible number of tiles among -polyforms with holes. Sharpness conjecture. If is an extremal -polyform, then is crystallized, and
The preceding theorem proves the corresponding upper bound. The conjecture asserts that the construction from an extremal -polyform always attains that bound; the source gives no proof of the reverse inequality.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.