Conjecture on the complexity of tromino tilings of extended domino-deficient rectangles
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.
References
- Mridul Aanjaneya, “Tromino tilings of Domino-Deficient Rectangles”, arXiv:cs/0606059 (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.