Polynomial and analytic methods for classifying complexity of planar graph homomorphisms

We introduce some polynomial and analytic methods in the classification program for the complexity of planar graph homomorphisms. These methods allow us to handle infinitely many lattice conditions and isolate the new P-time tractable matrices represented by tensor products of matchgates. We use these methods to prove a complexity dichotomy for $4\times 4$ matrices that says Valiant’s holographic algorithm is universal for planar tractability in this setting.