
The complexity of the fermionant, and immanants of constant width
In the context of statistical physics, Chandrasekharan and Wiese recently introduced the emph{fermionant} $Ferm_k$, a determinant-like quantity where each permutation $pi$ is weighted by $-k$ raised to the number of cycles in $pi$. We show that computing $Ferm_k$ is #P-hard under Turing reductions f







