_________
| |
| ___ |
|____| |_|
ThisWhat is justcounter-intuitive, is that both theories focus on the edges rather than the squares and don't really care about dominoes, but instead about counting perfect matchings.
Here is a made upshape of a deficient rectangle. And I split into 4 rectangles and for each region I can count the tilings. We are not done because it's possible to have dominoes cross the border slightly.
CR Cimasoni-shape whose cardinality could be computedReshetikhin says (among many other things), that you define a matrix indexed by such gluing axiomsthe edges that cross the boundary, and you "resolve" each one. Either there's domino there or not... So in this way, if we can getyou "glue" the two setsrectangles together, you have to glue $2^n$ nearby shapes, where $n$ counts the number of axiomsborder edges.
They obtain some formula which is phrased in terms of the Arf invariant of the Spin structure.
$$ Z(\Gamma) = \frac{1}{2^g} \sum_{[\xi] \in \mathcal{S}(\Sigma) } \text{Arf}(\xi) \; \text{Pf} (A^\Gamma)$$ where $[\xi]$ is a spin structure on the surface $\Sigma$ and $A^\Gamma$ is the Kasteleyn matrix. In a way, the Kasteleyn orientation is like a discrete spin structure.
GK Gaiotto-Kapustin define a topological invariant, so possibly we have ruled out the dimer model. Nor does [CR] claim to have a topological invariant. In any case, we can triangulate a manifold $X$ (in our case, the rectangle $$ X = \Big( [0,10]\times [0,10] \Big) \backslash \Big( [4,8] \times [5,8] \Big) $$ So we should define a triangulation on the dual graph.
The definition in [GK] should agree with what I've discussed before, I've practically outlined what it should be. It is a weighted sum over various "acceptable" . If we choose $A$ correctly and the weights $C_{ijk}$ and $g_{ij} = C_{ik}^l C_{jl}^k$, then perhaps we get a count of the domino tilings.