Conjecture on the complexity of tromino tilings of extended domino-deficient rectangles
Statement
Let denote the number of tromino tilings of an rectangle. Consider an extended domino-deficient rectangle with minimal dimensions , where . Complexity conjecture. The complexity of the number of tromino tilings changes from to
This conjecture proposes that introducing a minimal extension and a domino deficiency increases the tiling-count complexity by a factor linear in the sum of the rectangle dimensions. The preceding analysis motivates the claim, but no general proof or resolution is given here.
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.