ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let T{\bf T} be a finite set of polyomino tiles on the square grid, with copies restricted to parallel translations. A tiling of [n×n][n\times n] with T{\bf T} is a covering by translated tiles without overlap. The class #EXP\#\mathrm{EXP} consists of counting problems for objects verifiable in exponential time.

Square-tiling hardness conjecture. There exists a finite set of tiles T{\bf T} such that counting the number of tilings of [n×n][n\times n] with T{\bf T} is #EXP\#\mathrm{EXP}-complete.

This conjecture predicts exponential-hierarchy counting hardness even for square regions and a fixed tile set. The surrounding discussion emphasizes known hardness for general and slim regions, but gives no proof of the square-region claim.

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.