2 problems
Matching
Finite-presentation conjecture. has either of the following two equivalent finite presentations:
Stone-parity conjecture. The sign of corresponds to the parity of the minimum number of stones needed for to be signed tilable when adding tiles of either weight a…