2 problems

Stone-parity conjecture. The sign of $\partial R$ corresponds to the parity of the minimum number of stones needed for $R$ to be signed tilable when adding tiles of either weight a…

Signed-tiling conjecture. If $n=3$ or $n=6$, then the contribution of $L$ is $0$ unless there exists a signed tiling of $L$ by stones, bones, and snakes; if such a signed tiling ex…