ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let NT(m,n)N_T(m,n) denote the number of tromino tilings of an m×nm\times n rectangle. Consider an extended domino-deficient rectangle with minimal dimensions m×n′m\times n', where n′>nn'>n. Complexity conjecture. The complexity of the number of tromino tilings changes from NT(m,n)N_T(m,n) to

O((m+n)⋅NT(m,n)).\mathcal{O}((m+n)\cdot N_T(m,n)).

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 4×n4\times n 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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.