This article is out of date. Burgisser, Ikenmeyer, and Panova showed this approach can't work in their paper "No Occurence Obstructions in Geometric Complexity Theory." I haven't edited wikipedia in years, I would prefer if someone else could take care of this edit.
- Thank you for the info. I have added an external link to a relevant mathverflow discussion, for now. I don’t feel I have enough understanding of the theory to tell whether the program is doomed or not. -- Taku (talk) 21:22, 2 January 2018 (UTC)