Group Action and Spin Representation Lead to a Holant* Complexity Dichotomy on Domain Size 3Research Paper
Counting problems such as counting perfect matchings, edge colourings or weighted graph homomorphisms can all be written as Holant problems: one sums, over all assignments of domain values to the edges of a graph, the product of local constraint functions at the vertices. Complexity theory asks for a dichotomy: a criterion on the constraint functions that…