Recently computer scientist Leslie Valliant won the ACM’s Turing Award, considered one of the most prestigious prizes in computer science. Valliant is famous for many results, not the least of which are his results on the Permanent of a matrix. Over at the Godel’s Lost Letter, the iced tea man has a nice collection of interesting permanent related complexity facts. Recall that the permanent of a n by n matrix is given by

where is the symmetric group on n elements and similarly the determinant of a n by n matrix is given by

where is 0 if the permutation is made up of an even number of transpositions and 1 if the permutation is made up of an odd number of transpositions. One day I was sitting in my office when a physics undergraduate came by (a former ex-sailor from Alaska) and said…”Hey Dave, what if we replace the function in front of each term in the permanent and determinant by a character of a symmetric group irrep?” Which of course knocked me off my chair, first because what undergrad physics major knows about symmetric group irreps and second because I had never thought about this interesting twist on the permanent and determinant.

After a little google foo later, we quickly found the answer. For an n by n matrix the immanant of a matrix is given by

where labels the irrep of and is the character of the irrep at group element . Recall that the irreps of the symmetric group are labeled by partitions of . A partition of is a series of decreasing positive integers that sums to n, with such that . The partition corresponding to corresponds to the trivial irrep in which , and on the opposite end of the spectrum, the partition corresponding to corresponds to the alternating irrep where . Thus we see that the permanent and determinant are at the end of a spectrum of polynomials known as the immanants.

One of Valiant’s most well known results is that evaluating the permanent of a matrix with 0 and 1 as its possible matrix entries is #P complete, a.k.a really hard. On the other hand evaluating the determinant is not computationally difficult at all. At first this seems odd because a determinant has those minus signs which you would think would make it easier and not hard, but alas this is not so. So what about the computational complexity of the immanant? The Computational Complexity of Immanants by Peter Bürgisser (sorry I could only find a paywalled version) shows that there is a since in which certain immanants are also #P complete to evaluate. Rough the idea is that if one defines a class of immanants that have partitions that have a “step” in them that grows polynomially in (the step for the permanent is ) then these will be #P complete to evaluate.

So what good are immanants? Well I’m sure mathematicians have some fine uses for them. One interesting thing to note is that immanantal polynomials of adjacency matrices of graphs give you graph invariants (for the determinant this is the same as saying that the eigenvalues of the adjacency matrix are a graph invariant.) However it is known that this, like the eigenvalues, is not a complete set of graph invariants and so is not a route towards efficiently solving graph isomorphism. So no real use there, but I’m sure an object so symmetric must be of some use, no?

Hi Dave,

I coincidentally stumbled upon these a couple of months ago too, in Wybourne’s book (Symmetry principles and atomic spectroscopy). I believe they’re introduced there mainly as a route to Schur functions and their use in representation theory. But since (I believe Scheel’s) realisation that coincidence scattering in quantum optics essentially `computes’ the permanent of the interference matrix, I got excited that they might have application there…aaaaand have had no time to think about it.

Cheers,

P.

Another interesting object to think about is the matrix valued object which instead of putting the character for each group element puts the matrix entry of the irrep. I have no idea if this is good for anything, but its a natural generalization!

Thanks for the link gm!

Nice blog! You can find online the treatment of immanants in Peter BÃ¼rgisser’s habilitation thesis, which is similar to his book “Completeness and Reduction in Algebraic Complexity Theory”:

(In the Theses section at the end)

Ah the link is gone, let’s try this:

math-www.uni-paderborn.de/agpb/papers.html