The Tutte polynomial of a morphism of matroids 4. Computational complexity

Abstract

We determine the easy points of the 3-variable Tutte polynomial of a matroid perspective. It turns out that all but one of the sporadic easy points of the 3-variable Tutte polynomial proceed from the 8 sporadic easy points determined in the seminal paper of Jaeger–Vertigan–Welsh on the computational complexity of the Tutte polynomial of a matroid. The exceptional easy point, namely $(-1,-1,-1)$, can be evaluated with polynomial complexity for binary matroid perspectives by a previous result of the author.