7 votes
Accepted

Two extremely naive questions about the Kronecker problem from Geometric Complexity Theory

A) The input here is the triple of partitions $(\lambda, \mu, \nu)$, represented as sequences of numbers in binary. The dimension of the irreducible representation $M_{\lambda}$ can actually be ...
Vladimir Lysikov's user avatar
7 votes

Should GCT focus on $PSPACE\not\subseteq P/poly$?

Sure, in principle it could be used to separate the levels of $\mathsf{PH}$...the key thing is to find polynomial families complete for the relevant classes (or, at least polynomial families $f, g$ ...
Joshua Grochow's user avatar
6 votes
Accepted

Noether’s Normalization Lemma for finite fields

I believe the answer is yes. The only part I haven't checked carefully is: The argument in the middle of Theorem 4.2 using the complex topology, and the fact that the Zariski closure = complex ...
Joshua Grochow's user avatar
5 votes
Accepted

Application of weak determinantal identities to GCT?

Determinantal identities can be useful, but perhaps not exactly in the way you think. As far as I know, however, the identities do not all "reduce to" the symmetries of the determinant (except for the ...
Joshua Grochow's user avatar
4 votes

Wikipedia-style explanation of Geometric Complexity Theory

I recently gave an answer to a related question on Mathoverflow https://mathoverflow.net/questions/277408/what-are-the-current-breakthroughs-of-geometric-complexity-theory Since this site is perhaps ...
Abdelmalek Abdesselam's user avatar
4 votes

Papers on relation between computational complexity and algebraic geometry/topology?

Some recent references here from Algebraic Topology, and UGC hardness- Morse Theory , and another reference Unique Games Conjecture and Computational Topology . The latter is about covering spaces ...
user3483902's user avatar
  • 1,261

Only top scored, non community-wiki answers of a minimum length are eligible